Base | Representation |
---|---|
bin | 1001101001000010010101… |
… | …01001101000100010110011 |
3 | 2210001211000211212211201111 |
4 | 10310201022221220202303 |
5 | 10234330040004013021 |
6 | 113031411334414151 |
7 | 4315510526042056 |
oct | 464411251504263 |
9 | 83054024784644 |
10 | 21201211001011 |
11 | 6834423994108 |
12 | 2464b2a801357 |
13 | baa35b745292 |
14 | 53420353aa9d |
15 | 26b75b0318e1 |
hex | 13484aa688b3 |
21201211001011 has 48 divisors (see below), whose sum is σ = 22851963993600. Its totient is φ = 19663985521152.
The previous prime is 21201211000999. The next prime is 21201211001017. The reversal of 21201211001011 is 11010011210212.
It is a happy number.
It is not a de Polignac number, because 21201211001011 - 25 = 21201211000979 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21201211000982 and 21201211001000.
It is not an unprimeable number, because it can be changed into a prime (21201211001017) 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 47 ways as a sum of consecutive naturals, for example, 4996748056 + ... + 4996752298.
It is an arithmetic number, because the mean of its divisors is an integer number (476082583200).
Almost surely, 221201211001011 is an apocalyptic number.
21201211001011 is a deficient number, since it is larger than the sum of its proper divisors (1650752992589).
21201211001011 is a wasteful number, since it uses less digits than its factorization.
21201211001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5308 (or 5291 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 21201211001011 its reverse (11010011210212), we get a palindrome (32211222211223).
The spelling of 21201211001011 in words is "twenty-one trillion, two hundred one billion, two hundred eleven million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •