Base | Representation |
---|---|
bin | 10111000000101010111110… |
… | …001111101110000010010000 |
3 | 111021022202000102010222220022 |
4 | 113000222332033232002100 |
5 | 101231040040033020422 |
6 | 555123110012003012 |
7 | 30213355233064253 |
oct | 2700527617560220 |
9 | 437282012128808 |
10 | 101201211220112 |
11 | 2a278213472923 |
12 | b425580a60468 |
13 | 4461305653133 |
14 | 1adc24414b09a |
15 | ba77209b0342 |
hex | 5c0abe3ee090 |
101201211220112 has 80 divisors (see below), whose sum is σ = 207230743050240. Its totient is φ = 47779059309696.
The previous prime is 101201211220093. The next prime is 101201211220127. The reversal of 101201211220112 is 211022112102101.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 157919123 + ... + 158558669.
It is an arithmetic number, because the mean of its divisors is an integer number (2590384288128).
Almost surely, 2101201211220112 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 101201211220112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (103615371525120).
101201211220112 is an abundant number, since it is smaller than the sum of its proper divisors (106029531830128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101201211220112 is a wasteful number, since it uses less digits than its factorization.
101201211220112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 645100 (or 645094 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 101201211220112 its reverse (211022112102101), we get a palindrome (312223323322213).
The spelling of 101201211220112 in words is "one hundred one trillion, two hundred one billion, two hundred eleven million, two hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •