Base | Representation |
---|---|
bin | 1001001111101110000001… |
… | …00000110010000010100011 |
3 | 2122222122122221201220111001 |
4 | 10213313000200302002203 |
5 | 10131102010331443021 |
6 | 111124024101532431 |
7 | 4165613546562430 |
oct | 447670040620243 |
9 | 78878587656431 |
10 | 20331310031011 |
11 | 6529507527021 |
12 | 2344416714117 |
13 | b46307a153c5 |
14 | 50407d7bab87 |
15 | 253ce6191091 |
hex | 127dc08320a3 |
20331310031011 has 8 divisors (see below), whose sum is σ = 23863777025120. Its totient is φ = 16955841570048.
The previous prime is 20331310030963. The next prime is 20331310031113. The reversal of 20331310031011 is 11013001313302.
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 20331310031011 - 225 = 20331276476579 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20331310031011.
It is not an unprimeable number, because it can be changed into a prime (20331310037011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39249633006 + ... + 39249633523.
It is an arithmetic number, because the mean of its divisors is an integer number (2982972128140).
Almost surely, 220331310031011 is an apocalyptic number.
20331310031011 is a deficient number, since it is larger than the sum of its proper divisors (3532466994109).
20331310031011 is an equidigital number, since it uses as much as digits as its factorization.
20331310031011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78499266573.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 20331310031011 its reverse (11013001313302), we get a palindrome (31344311344313).
The spelling of 20331310031011 in words is "twenty trillion, three hundred thirty-one billion, three hundred ten million, thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •