Base | Representation |
---|---|
bin | 1001010010010111101110… |
… | …1011010101101100010000 |
3 | 1100011011220221021210022122 |
4 | 2110211323223111230100 |
5 | 2314300030312034300 |
6 | 33414544403553412 |
7 | 2102510233531664 |
oct | 224457353255420 |
9 | 40134827253278 |
10 | 10211212221200 |
11 | 3287607102a31 |
12 | 118b00238b868 |
13 | 590bb4347bc3 |
14 | 2743223648a4 |
15 | 12a93c8c6c85 |
hex | 9497bad5b10 |
10211212221200 has 60 divisors (see below), whose sum is σ = 24544388890788. Its totient is φ = 4082495040000.
The previous prime is 10211212221193. The next prime is 10211212221307. The reversal of 10211212221200 is 212221211201.
10211212221200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 13255377424 + 10197956843776 = 115132^2 + 3193424^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5396051 + ... + 7038450.
Almost surely, 210211212221200 is an apocalyptic number.
10211212221200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10211212221200 is an abundant number, since it is smaller than the sum of its proper divisors (14333176669588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10211212221200 is a wasteful number, since it uses less digits than its factorization.
10211212221200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12436572 (or 12436561 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 10211212221200 its reverse (212221211201), we get a palindrome (10423433432401).
The spelling of 10211212221200 in words is "ten trillion, two hundred eleven billion, two hundred twelve million, two hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •