104
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 5
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 210
- Proper Divisor Sum (Aliquot Sum)
- 106
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 48
- Möbius Function
- 0
- Radical
- 26
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 12
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Names
- German
- einshundertvier· ordinal: einshundertvierste
- English
- one hundred four· ordinal: one hundred fourth
- Spanish
- ciento cuatro· ordinal: 104º
- French
- cent quatre· ordinal: cent quatrième
- Italian
- centoquattro· ordinal: 104º
- Latin
- centum quattuor· ordinal: 104.
- Portuguese
- cento e quatro· ordinal: 104º
Appears in sequences
- Number of ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=31A000008
- Expansion of Product_{m >= 1} (1 + x^m); number of partitions of n into distinct parts; number of partitions of n into odd parts.at n=23A000009
- Let k = p_1^e_1 p_2^e_2 p_3^e_3 ... be the prime factorization of n. Sequence gives k such that the sum of the numbers of 1's in the binary expansions of e_1, e_2, e_3, ... is odd.at n=49A000028
- Generalized tangent numbers d(n,1).at n=38A000061
- Odious numbers: numbers with an odd number of 1's in their binary expansion.at n=52A000069
- a(n) = n*(n+3)/2.at n=13A000096
- Number of ways of writing n as a sum of 4 squares; also theta series of four-dimensional cubic lattice Z^4.at n=9A000118
- a(n) = sigma(n), the sum of the divisors of n. Also called sigma_1(n).at n=62A000203
- A Beatty sequence: floor(n*(e-1)).at n=60A000210
- a(n) = (n+1)*(n+3)*(n+8)/6.at n=6A000297
- 6th power of rooted tree enumerator; number of linear forests of 6 rooted trees.at n=3A000395
- Numbers that are the sum of 2 nonzero squares.at n=36A000404
- Numbers that are the sum of three nonzero squares.at n=68A000408
- Numbers that are the sum of 2 but no fewer nonzero squares.at n=34A000415
- n written in base where place values are positive cubes.at n=31A000433
- Number of steps to reach 1 in sequence A000546.at n=22A000547
- A Beatty sequence: [ n(e+1) ].at n=27A000572
- a(n) = 13*binomial(2n,n-6)/(n+7).at n=2A000590
- Number of nonnegative solutions of x^2 + y^2 = z in first n shells.at n=50A000592
- Sum of odd divisors of n.at n=62A000593