Base | Representation |
---|---|
bin | 1001001111101100001001… |
… | …11111000011010101101111 |
3 | 2122222120002100111210200101 |
4 | 10213312010333003111233 |
5 | 10131042434200130411 |
6 | 111123341024211531 |
7 | 4165550032024204 |
oct | 447660477032557 |
9 | 78876070453611 |
10 | 20330311333231 |
11 | 6529044812659 |
12 | 2344198169ba7 |
13 | b461a8b42b83 |
14 | 503dc6ccbcab |
15 | 253c8866a8c1 |
hex | 127d84fc356f |
20330311333231 has 2 divisors, whose sum is σ = 20330311333232. Its totient is φ = 20330311333230.
The previous prime is 20330311333181. The next prime is 20330311333309. The reversal of 20330311333231 is 13233311303302.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20330311333231 - 27 = 20330311333103 is a prime.
It is a super-2 number, since 2×203303113332312 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20330311333231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20330311333931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10165155666615 + 10165155666616.
It is an arithmetic number, because the mean of its divisors is an integer number (10165155666616).
Almost surely, 220330311333231 is an apocalyptic number.
20330311333231 is a deficient number, since it is larger than the sum of its proper divisors (1).
20330311333231 is an equidigital number, since it uses as much as digits as its factorization.
20330311333231 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 20330311333231 its reverse (13233311303302), we get a palindrome (33563622636533).
The spelling of 20330311333231 in words is "twenty trillion, three hundred thirty billion, three hundred eleven million, three hundred thirty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •