Base | Representation |
---|---|
bin | 101111010100000110… |
… | …0001000100111111011 |
3 | 100201021002121122122200 |
4 | 1132220030020213323 |
5 | 3131042114014042 |
6 | 114402133121243 |
7 | 10224614521410 |
oct | 1365014104773 |
9 | 321232548580 |
10 | 101606001147 |
11 | 3a0aaa36582 |
12 | 17837789223 |
13 | 9773466b91 |
14 | 4cbc478107 |
15 | 299a221c4c |
hex | 17a83089fb |
101606001147 has 24 divisors (see below), whose sum is σ = 167739936000. Its totient is φ = 58057320240.
The previous prime is 101606001121. The next prime is 101606001157. The reversal of 101606001147 is 741100606101.
101606001147 is a `hidden beast` number, since 1 + 0 + 1 + 6 + 0 + 600 + 11 + 47 = 666.
It is not a de Polignac number, because 101606001147 - 219 = 101605476859 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101606001147.
It is not an unprimeable number, because it can be changed into a prime (101606001157) 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 23 ways as a sum of consecutive naturals, for example, 1510522 + ... + 1576352.
It is an arithmetic number, because the mean of its divisors is an integer number (6989164000).
Almost surely, 2101606001147 is an apocalyptic number.
101606001147 is a deficient number, since it is larger than the sum of its proper divisors (66133934853).
101606001147 is a wasteful number, since it uses less digits than its factorization.
101606001147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90343 (or 90340 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 27.
Adding to 101606001147 its reverse (741100606101), we get a palindrome (842706607248).
The spelling of 101606001147 in words is "one hundred one billion, six hundred six million, one thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •