Base | Representation |
---|---|
bin | 1001100100000101010010… |
… | …10010010001100011011101 |
3 | 2202110112200112220011201121 |
4 | 10302002221102101203131 |
5 | 10224032442001134323 |
6 | 112421301422410541 |
7 | 4300303533426340 |
oct | 462025122214335 |
9 | 82415615804647 |
10 | 21031000021213 |
11 | 6779219264776 |
12 | 2437b47430a51 |
13 | b972a3b8b3a0 |
14 | 529c97864457 |
15 | 2670e7e0da5d |
hex | 1320a94918dd |
21031000021213 has 16 divisors (see below), whose sum is σ = 26719285390336. Its totient is φ = 16103140744320.
The previous prime is 21031000021181. The next prime is 21031000021243. The reversal of 21031000021213 is 31212000013012.
It is not a de Polignac number, because 21031000021213 - 25 = 21031000021181 is a prime.
It is a super-2 number, since 2×210310000212132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21031000021243) 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 15 ways as a sum of consecutive naturals, for example, 3727576056 + ... + 3727581697.
It is an arithmetic number, because the mean of its divisors is an integer number (1669955336896).
Almost surely, 221031000021213 is an apocalyptic number.
It is an amenable number.
21031000021213 is a deficient number, since it is larger than the sum of its proper divisors (5688285369123).
21031000021213 is a wasteful number, since it uses less digits than its factorization.
21031000021213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7455157804.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 21031000021213 its reverse (31212000013012), we get a palindrome (52243000034225).
The spelling of 21031000021213 in words is "twenty-one trillion, thirty-one billion, twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •