Base | Representation |
---|---|
bin | 10110111110000010010011… |
… | …110101101010111010110100 |
3 | 111020200102120020100210212211 |
4 | 112332002103311222322310 |
5 | 101220103141421401400 |
6 | 554503555352223204 |
7 | 30164314345462312 |
oct | 2676022365527264 |
9 | 436612506323784 |
10 | 101020111122100 |
11 | 2a208430159835 |
12 | b3b645a99ab04 |
13 | 444a203b25421 |
14 | 1ad35841c90b2 |
15 | ba2b71901dba |
hex | 5be093d6aeb4 |
101020111122100 has 36 divisors (see below), whose sum is σ = 219228310441504. Its totient is φ = 40405340429280.
The previous prime is 101020111122059. The next prime is 101020111122101. The reversal of 101020111122100 is 1221111020101.
It is a happy number.
It is a super-2 number, since 2×1010201111221002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101020111122101) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 32298072 + ... + 35287471.
Almost surely, 2101020111122100 is an apocalyptic number.
101020111122100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101020111122100 is an abundant number, since it is smaller than the sum of its proper divisors (118208199319404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101020111122100 is a wasteful number, since it uses less digits than its factorization.
101020111122100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67600504 (or 67600497 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101020111122100 its reverse (1221111020101), we get a palindrome (102241222142201).
The spelling of 101020111122100 in words is "one hundred one trillion, twenty billion, one hundred eleven million, one hundred twenty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •