Base | Representation |
---|---|
bin | 1001000111010011001000… |
… | …1010000110101100001011 |
3 | 1022110222221201211111220210 |
4 | 2101310302022012230023 |
5 | 2303141002023224321 |
6 | 33151330044252203 |
7 | 2052664504242003 |
oct | 221646212065413 |
9 | 38428851744823 |
10 | 10021000211211 |
11 | 3213978410580 |
12 | 115a178841063 |
13 | 578c8cb154c2 |
14 | 26903a1b9003 |
15 | 125a088d2b76 |
hex | 91d32286b0b |
10021000211211 has 32 divisors (see below), whose sum is σ = 15306616954368. Its totient is φ = 5772273661440.
The previous prime is 10021000211171. The next prime is 10021000211333. The reversal of 10021000211211 is 11211200012001.
It is not a de Polignac number, because 10021000211211 - 27 = 10021000211083 is a prime.
It is a super-2 number, since 2×100210002112112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10021000211711) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 41928286 + ... + 42166611.
It is an arithmetic number, because the mean of its divisors is an integer number (478331779824).
Almost surely, 210021000211211 is an apocalyptic number.
10021000211211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10021000211211 is a deficient number, since it is larger than the sum of its proper divisors (5285616743157).
10021000211211 is a wasteful number, since it uses less digits than its factorization.
10021000211211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84095091.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10021000211211 its reverse (11211200012001), we get a palindrome (21232200223212).
The spelling of 10021000211211 in words is "ten trillion, twenty-one billion, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •