Base | Representation |
---|---|
bin | 1001001100100110111011… |
… | …0000011101001011111000 |
3 | 1022210201101101102101110011 |
4 | 2103021232300131023320 |
5 | 2311134302032223000 |
6 | 33301252524431304 |
7 | 2062404010036123 |
oct | 223115660351370 |
9 | 38721341371404 |
10 | 10112211211000 |
11 | 3249623670738 |
12 | 11739930a8534 |
13 | 5847677b08b2 |
14 | 26d60dc6b3ba |
15 | 12809621e2ba |
hex | 9326ec1d2f8 |
10112211211000 has 64 divisors (see below), whose sum is σ = 24691381865280. Its totient is φ = 3869019932800.
The previous prime is 10112211210967. The next prime is 10112211211027. The reversal of 10112211211000 is 11211221101.
It is a happy number.
10112211211000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
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, 219807679 + ... + 219853678.
It is an arithmetic number, because the mean of its divisors is an integer number (385802841645).
Almost surely, 210112211211000 is an apocalyptic number.
10112211211000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10112211211000 is an abundant number, since it is smaller than the sum of its proper divisors (14579170654280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10112211211000 is a wasteful number, since it uses less digits than its factorization.
10112211211000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 439661401 (or 439661387 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10112211211000 its reverse (11211221101), we get a palindrome (10123422432101).
The spelling of 10112211211000 in words is "ten trillion, one hundred twelve billion, two hundred eleven million, two hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •