Base | Representation |
---|---|
bin | 1001000110001100011011… |
… | …11000100001011110110011 |
3 | 2121211100221011021101010010 |
4 | 10203012031320201132303 |
5 | 10110221240013232011 |
6 | 110313421443510003 |
7 | 4133146556563434 |
oct | 443061570413663 |
9 | 77740834241103 |
10 | 20004043102131 |
11 | 6412737910560 |
12 | 22b0b01688303 |
13 | b214b0b16c6a |
14 | 4d22b51d148b |
15 | 24a53ecc21a6 |
hex | 12318de217b3 |
20004043102131 has 16 divisors (see below), whose sum is σ = 29096890698240. Its totient is φ = 12123620514720.
The previous prime is 20004043102111. The next prime is 20004043102133. The reversal of 20004043102131 is 13120134040002.
It is not a de Polignac number, because 20004043102131 - 215 = 20004043069363 is a prime.
It is a super-3 number, since 3×200040431021313 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 20004043102098 and 20004043102107.
It is not an unprimeable number, because it can be changed into a prime (20004043102133) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10536790 + ... + 12289508.
It is an arithmetic number, because the mean of its divisors is an integer number (1818555668640).
Almost surely, 220004043102131 is an apocalyptic number.
20004043102131 is a deficient number, since it is larger than the sum of its proper divisors (9092847596109).
20004043102131 is a wasteful number, since it uses less digits than its factorization.
20004043102131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2098586.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 20004043102131 its reverse (13120134040002), we get a palindrome (33124177142133).
The spelling of 20004043102131 in words is "twenty trillion, four billion, forty-three million, one hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •