107
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 108
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 106
- Möbius Function
- -1
- Radical
- 107
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 100
- Smith Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- yes
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 28
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- einshundertsieben· ordinal: einshundertsiebenste
- English
- one hundred seven· ordinal: one hundred seventh
- Spanish
- ciento siete· ordinal: 107º
- French
- cent sept· ordinal: cent septième
- Italian
- centosette· ordinal: 107º
- Latin
- centum septem· ordinal: 107.
- Portuguese
- cento e sete· ordinal: 107º
Appears in sequences
- 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=51A000028
- Mersenne exponents: primes p such that 2^p - 1 is prime. Then 2^p - 1 is called a Mersenne prime.at n=10A000043
- Odious numbers: numbers with an odd number of 1's in their binary expansion.at n=53A000069
- Number of n-celled free polyominoes without holes.at n=7A000104
- Number of oriented rooted trees with n nodes. Also rooted trees with n nodes and 2-colored non-root nodes.at n=4A000151
- a(8i+j) = 13i + a(j), where 1<=j<=8.at n=65A000202
- Numbers that are the sum of 3 but no fewer nonzero squares.at n=44A000419
- Primes and squares of primes.at n=31A000430
- n written in base where place values are positive cubes.at n=34A000433
- A Beatty sequence: [ n(e+1) ].at n=28A000572
- Expansion of Product_{k>=0} (1 + x^(2k+1)); number of partitions of n into distinct odd parts; number of self-conjugate partitions; number of symmetric Ferrers graphs with n nodes.at n=51A000700
- n-th superior highly composite number A002201(n) is product of first n terms of this sequence.at n=44A000705
- Number of partitions of n, with three kinds of 1,2,3 and 4 and two kinds of 5,6,7,...at n=5A000711
- E.g.f. exp(tan(x) + sec(x) - 1).at n=5A000772
- Numbers that are not the sum of 4 tetrahedral numbers.at n=8A000797
- Numbers beginning with a vowel in English.at n=21A000852
- Numbers beginning with letter 'o' in English.at n=8A000865
- Powers of primes. Alternatively, 1 and the prime powers (p^k, p prime, k >= 1).at n=38A000961
- Numbers k such that sum of squares of k consecutive integers >= 1 is a square.at n=16A001032
- Union of all numbers {p, q} where p and q are both primes or powers of primes and q = p+2.at n=29A001092