Base | Representation |
---|---|
bin | 1001100100000101101100… |
… | …11001011110100100000001 |
3 | 2202110120020212211221011011 |
4 | 10302002312121132210001 |
5 | 10224033414310411223 |
6 | 112421335321520521 |
7 | 4300312144350616 |
oct | 462026631364401 |
9 | 82416225757134 |
10 | 21031220013313 |
11 | 6779321462024 |
12 | 2437ba9043141 |
13 | b9730a625323 |
14 | 529cb8b6c50d |
15 | 26710c3b680d |
hex | 1320b665e901 |
21031220013313 has 8 divisors (see below), whose sum is σ = 21238133758400. Its totient is φ = 20824358713488.
The previous prime is 21031220013299. The next prime is 21031220013343. The reversal of 21031220013313 is 31331002213012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21031220013313 - 217 = 21031219882241 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21031220013343) 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 7 ways as a sum of consecutive naturals, for example, 12305103 + ... + 13909636.
It is an arithmetic number, because the mean of its divisors is an integer number (2654766719800).
Almost surely, 221031220013313 is an apocalyptic number.
It is an amenable number.
21031220013313 is a deficient number, since it is larger than the sum of its proper divisors (206913745087).
21031220013313 is a wasteful number, since it uses less digits than its factorization.
21031220013313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26222631.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 21031220013313 its reverse (31331002213012), we get a palindrome (52362222226325).
The spelling of 21031220013313 in words is "twenty-one trillion, thirty-one billion, two hundred twenty million, thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •