Base | Representation |
---|---|
bin | 1001010010011011000101… |
… | …0011101110010000001100 |
3 | 1100011021020122101021210211 |
4 | 2110212301103232100030 |
5 | 2314303401133000022 |
6 | 33415213545212204 |
7 | 2102541440526556 |
oct | 224466123562014 |
9 | 40137218337724 |
10 | 10212112000012 |
11 | 3287a28aa408a |
12 | 118b213791064 |
13 | 590cc88949c0 |
14 | 2743a9a644d6 |
15 | 12a9918ace77 |
hex | 949b14ee40c |
10212112000012 has 144 divisors (see below), whose sum is σ = 20772234604800. Its totient is φ = 4364926081920.
The previous prime is 10212112000007. The next prime is 10212112000067. The reversal of 10212112000012 is 21000021121201.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 10212111999956 and 10212112000001.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 198225337 + ... + 198276847.
It is an arithmetic number, because the mean of its divisors is an integer number (144251629200).
Almost surely, 210212112000012 is an apocalyptic number.
It is an amenable number.
10212112000012 is an abundant number, since it is smaller than the sum of its proper divisors (10560122604788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10212112000012 is a wasteful number, since it uses less digits than its factorization.
10212112000012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51804 (or 51783 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10212112000012 its reverse (21000021121201), we get a palindrome (31212133121213).
The spelling of 10212112000012 in words is "ten trillion, two hundred twelve billion, one hundred twelve million, twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •