Base | Representation |
---|---|
bin | 1001101100001111000100… |
… | …10110000111001110010101 |
3 | 2210110022202022020212002201 |
4 | 10312013202112013032111 |
5 | 10243130143312444104 |
6 | 113154110440404501 |
7 | 4326451446613642 |
oct | 466074226071625 |
9 | 83408668225081 |
10 | 21311130203029 |
11 | 6876aaa468527 |
12 | 24822a6476731 |
13 | bb7828292814 |
14 | 53966dacadc9 |
15 | 26e540eb90a4 |
hex | 1361e2587395 |
21311130203029 has 4 divisors (see below), whose sum is σ = 21478934377984. Its totient is φ = 21143326028076.
The previous prime is 21311130203021. The next prime is 21311130203047. The reversal of 21311130203029 is 92030203111312.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 21311130203029 - 23 = 21311130203021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21311130202988 and 21311130203006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21311130203021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 83902087287 + ... + 83902087540.
It is an arithmetic number, because the mean of its divisors is an integer number (5369733594496).
Almost surely, 221311130203029 is an apocalyptic number.
It is an amenable number.
21311130203029 is a deficient number, since it is larger than the sum of its proper divisors (167804174955).
21311130203029 is a wasteful number, since it uses less digits than its factorization.
21311130203029 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 167804174954.
The product of its (nonzero) digits is 1944, while the sum is 28.
The spelling of 21311130203029 in words is "twenty-one trillion, three hundred eleven billion, one hundred thirty million, two hundred three thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •