Base | Representation |
---|---|
bin | 110001011010000100… |
… | …1010100000110010000 |
3 | 101010212101210111000110 |
4 | 1202310021110012100 |
5 | 3214243444234400 |
6 | 120424204321320 |
7 | 10444203225225 |
oct | 1426411240620 |
9 | 333771714013 |
10 | 106101555600 |
11 | 40aa7620137 |
12 | 18691243240 |
13 | a00b945081 |
14 | 51c754794c |
15 | 2b5ec32e50 |
hex | 18b4254190 |
106101555600 has 120 divisors (see below), whose sum is σ = 357767076640. Its totient is φ = 26804597760.
The previous prime is 106101555589. The next prime is 106101555601. The reversal of 106101555600 is 6555101601.
It is a tau number, because it is divible by the number of its divisors (120).
It is a super-2 number, since 2×1061015556002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (106101555601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2303989 + ... + 2349588.
Almost surely, 2106101555600 is an apocalyptic number.
106101555600 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106101555600 is an abundant number, since it is smaller than the sum of its proper divisors (251665521040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106101555600 is a wasteful number, since it uses less digits than its factorization.
106101555600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4653617 (or 4653606 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 30.
The spelling of 106101555600 in words is "one hundred six billion, one hundred one million, five hundred fifty-five thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •