Base | Representation |
---|---|
bin | 101111010100000111… |
… | …0011101110001010100 |
3 | 100201021010202200122210 |
4 | 1132220032131301110 |
5 | 3131042243041202 |
6 | 114402154153420 |
7 | 10224622644441 |
oct | 1365016356124 |
9 | 321233680583 |
10 | 101606612052 |
11 | 3a100313560 |
12 | 17837a22870 |
13 | 977361bc6a |
14 | 4cbc5969c8 |
15 | 299a2e2c6c |
hex | 17a839dc54 |
101606612052 has 48 divisors (see below), whose sum is σ = 259717248000. Its totient is φ = 30661044960.
The previous prime is 101606612047. The next prime is 101606612059. The reversal of 101606612052 is 250216606101.
It is a super-2 number, since 2×1016066120522 (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 (101606612059) 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 15 ways as a sum of consecutive naturals, for example, 1578802 + ... + 1641897.
It is an arithmetic number, because the mean of its divisors is an integer number (5410776000).
Almost surely, 2101606612052 is an apocalyptic number.
101606612052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101606612052 is an abundant number, since it is smaller than the sum of its proper divisors (158110635948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101606612052 is a wasteful number, since it uses less digits than its factorization.
101606612052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3220956 (or 3220954 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 30.
The spelling of 101606612052 in words is "one hundred one billion, six hundred six million, six hundred twelve thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •