Base | Representation |
---|---|
bin | 1001000110000100111110… |
… | …1101100100010001100100 |
3 | 1022101222210200010211202210 |
4 | 2101201033231210101210 |
5 | 2302320020412211322 |
6 | 33133540223403420 |
7 | 2051322563543535 |
oct | 221411755442144 |
9 | 38358720124683 |
10 | 10000021210212 |
11 | 3205a92300620 |
12 | 11560a2a53570 |
13 | 576cc8673747 |
14 | 268009c9068c |
15 | 1251cbc3270c |
hex | 9184fb64464 |
10000021210212 has 24 divisors (see below), whose sum is σ = 25454599444512. Its totient is φ = 3030309457600.
The previous prime is 10000021210187. The next prime is 10000021210247. The reversal of 10000021210212 is 21201212000001.
It is a Harshad number since it is a multiple of its sum of digits (12).
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 7 ways as a sum of consecutive naturals, for example, 37878868089 + ... + 37878868352.
It is an arithmetic number, because the mean of its divisors is an integer number (1060608310188).
Almost surely, 210000021210212 is an apocalyptic number.
10000021210212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10000021210212 is an abundant number, since it is smaller than the sum of its proper divisors (15454578234300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10000021210212 is a wasteful number, since it uses less digits than its factorization.
10000021210212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75757736459 (or 75757736457 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10000021210212 its reverse (21201212000001), we get a palindrome (31201233210213).
The spelling of 10000021210212 in words is "ten trillion, twenty-one million, two hundred ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •