Base | Representation |
---|---|
bin | 1001001111101101101010… |
… | …10111110100101001101001 |
3 | 2122222122011221001111122201 |
4 | 10213312311113310221221 |
5 | 10131101120010224113 |
6 | 111123553344020201 |
7 | 4165606120144366 |
oct | 447666527645151 |
9 | 78878157044581 |
10 | 20331123133033 |
11 | 6529420a82889 |
12 | 2344384001661 |
13 | b462a809789b |
14 | 504062a4946d |
15 | 253cd4a73cdd |
hex | 127db55f4a69 |
20331123133033 has 2 divisors, whose sum is σ = 20331123133034. Its totient is φ = 20331123133032.
The previous prime is 20331123132989. The next prime is 20331123133091. The reversal of 20331123133033 is 33033132113302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18771102148969 + 1560020984064 = 4332563^2 + 1249008^2 .
It is a cyclic number.
It is not a de Polignac number, because 20331123133033 - 225 = 20331089578601 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20331123132992 and 20331123133010.
It is not a weakly prime, because it can be changed into another prime (20331123133093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10165561566516 + 10165561566517.
It is an arithmetic number, because the mean of its divisors is an integer number (10165561566517).
Almost surely, 220331123133033 is an apocalyptic number.
It is an amenable number.
20331123133033 is a deficient number, since it is larger than the sum of its proper divisors (1).
20331123133033 is an equidigital number, since it uses as much as digits as its factorization.
20331123133033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8748, while the sum is 28.
Adding to 20331123133033 its reverse (33033132113302), we get a palindrome (53364255246335).
The spelling of 20331123133033 in words is "twenty trillion, three hundred thirty-one billion, one hundred twenty-three million, one hundred thirty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •