Base | Representation |
---|---|
bin | 10111000000101010110111… |
… | …101111111000110000000100 |
3 | 111021022201201211000211000112 |
4 | 113000222313233320300010 |
5 | 101231034324131241400 |
6 | 555123051115332152 |
7 | 30213352440403532 |
oct | 2700526757706004 |
9 | 437281654024015 |
10 | 101201102212100 |
11 | 2a278167989560 |
12 | b425550451058 |
13 | 44612b8ba7457 |
14 | 1adc233893152 |
15 | ba771612b835 |
hex | 5c0ab7bf8c04 |
101201102212100 has 72 divisors (see below), whose sum is σ = 239611499882496. Its totient is φ = 36794119600000.
The previous prime is 101201102212069. The next prime is 101201102212123. The reversal of 101201102212100 is 1212201102101.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1401476 + ... + 14295675.
It is an arithmetic number, because the mean of its divisors is an integer number (3327937498368).
Almost surely, 2101201102212100 is an apocalyptic number.
101201102212100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101201102212100 is an abundant number, since it is smaller than the sum of its proper divisors (138410397670396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101201102212100 is a wasteful number, since it uses less digits than its factorization.
101201102212100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15703037 (or 15703030 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101201102212100 its reverse (1212201102101), we get a palindrome (102413303314201).
The spelling of 101201102212100 in words is "one hundred one trillion, two hundred one billion, one hundred two million, two hundred twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •