Base | Representation |
---|---|
bin | 10111000000110011001010… |
… | …110001000001100101010000 |
3 | 111021100120201200212220111221 |
4 | 113000303022301001211100 |
5 | 101231211100332241422 |
6 | 555131123130214424 |
7 | 30214116266555515 |
oct | 2700631261014520 |
9 | 437316650786457 |
10 | 101210011212112 |
11 | 2a280a19876090 |
12 | b427217b84414 |
13 | 44620a88455aa |
14 | 1adc83ab7b30c |
15 | ba7a883303c7 |
hex | 5c0ccac41950 |
101210011212112 has 160 divisors (see below), whose sum is σ = 220554308370816. Its totient is φ = 44592914841600.
The previous prime is 101210011212103. The next prime is 101210011212133. The reversal of 101210011212112 is 211212110012101.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1901237848 + ... + 1901291080.
Almost surely, 2101210011212112 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 101210011212112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (110277154185408).
101210011212112 is an abundant number, since it is smaller than the sum of its proper divisors (119344297158704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101210011212112 is a wasteful number, since it uses less digits than its factorization.
101210011212112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54989 (or 54983 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 101210011212112 its reverse (211212110012101), we get a palindrome (312422121224213).
The spelling of 101210011212112 in words is "one hundred one trillion, two hundred ten billion, eleven million, two hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •