Base | Representation |
---|---|
bin | 1001000110001110011011… |
… | …00110000110101110001001 |
3 | 2121211110200122121210221112 |
4 | 10203013031212012232021 |
5 | 10110230432134001003 |
6 | 110314115510220105 |
7 | 4133215216314614 |
oct | 443071546065611 |
9 | 77743618553845 |
10 | 20005112015753 |
11 | 6413136223147 |
12 | 22b115b654635 |
13 | b21621402327 |
14 | 4d237715b17b |
15 | 24a5a3a673d8 |
hex | 1231cd986b89 |
20005112015753 has 4 divisors (see below), whose sum is σ = 20005122405648. Its totient is φ = 20005101625860.
The previous prime is 20005112015683. The next prime is 20005112015783. The reversal of 20005112015753 is 35751021150002.
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, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 20005112015753 - 222 = 20005107821449 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20005112015783) 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, 1366151 + ... + 6471212.
It is an arithmetic number, because the mean of its divisors is an integer number (5001280601412).
Almost surely, 220005112015753 is an apocalyptic number.
It is an amenable number.
20005112015753 is a deficient number, since it is larger than the sum of its proper divisors (10389895).
20005112015753 is an equidigital number, since it uses as much as digits as its factorization.
20005112015753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10389894.
The product of its (nonzero) digits is 10500, while the sum is 32.
Adding to 20005112015753 its reverse (35751021150002), we get a palindrome (55756133165755).
The spelling of 20005112015753 in words is "twenty trillion, five billion, one hundred twelve million, fifteen thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •