Base | Representation |
---|---|
bin | 110001101010010100… |
… | …1110100011001001111 |
3 | 101012021102001020221000 |
4 | 1203110221310121033 |
5 | 3221403104304112 |
6 | 120554250111343 |
7 | 10463545044630 |
oct | 1432451643117 |
9 | 335242036830 |
10 | 106646947407 |
11 | 41257470070 |
12 | 18803a1b553 |
13 | a097930c10 |
14 | 5239b57887 |
15 | 2b92a657dc |
hex | 18d4a7464f |
106646947407 has 128 divisors (see below), whose sum is σ = 213080555520. Its totient is φ = 50911182720.
The previous prime is 106646947397. The next prime is 106646947453. The reversal of 106646947407 is 704749646601.
106646947407 is a `hidden beast` number, since 106 + 6 + 4 + 69 + 474 + 0 + 7 = 666.
It is not a de Polignac number, because 106646947407 - 24 = 106646947391 is a prime.
It is a super-2 number, since 2×1066469474072 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106646947307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 6126438 + ... + 6143820.
It is an arithmetic number, because the mean of its divisors is an integer number (1664691840).
Almost surely, 2106646947407 is an apocalyptic number.
106646947407 is a deficient number, since it is larger than the sum of its proper divisors (106433608113).
106646947407 is a wasteful number, since it uses less digits than its factorization.
106646947407 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17650 (or 17644 counting only the distinct ones).
The product of its (nonzero) digits is 6096384, while the sum is 54.
The spelling of 106646947407 in words is "one hundred six billion, six hundred forty-six million, nine hundred forty-seven thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •