Base | Representation |
---|---|
bin | 10111000000101011101101… |
… | …111110011101001101011000 |
3 | 111021022211002012221212220212 |
4 | 113000223231332131031120 |
5 | 101231043210033013422 |
6 | 555123321255310252 |
7 | 30213414125442611 |
oct | 2700535576351530 |
9 | 437284065855825 |
10 | 101202012001112 |
11 | 2a278594497500 |
12 | b42576507b388 |
13 | 446140251a649 |
14 | 1adc2bc63ac08 |
15 | ba776ae3d9e2 |
hex | 5c0aedf9d358 |
101202012001112 has 96 divisors (see below), whose sum is σ = 213306365260800. Its totient is φ = 44959539387840.
The previous prime is 101202012001081. The next prime is 101202012001147. The reversal of 101202012001112 is 211100210202101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 31164743 + ... + 34258505.
It is an arithmetic number, because the mean of its divisors is an integer number (2221941304800).
Almost surely, 2101202012001112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101202012001112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (106653182630400).
101202012001112 is an abundant number, since it is smaller than the sum of its proper divisors (112104353259688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101202012001112 is a wasteful number, since it uses less digits than its factorization.
101202012001112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3094557 (or 3094542 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101202012001112 its reverse (211100210202101), we get a palindrome (312302222203213).
The spelling of 101202012001112 in words is "one hundred one trillion, two hundred two billion, twelve million, one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •