Base | Representation |
---|---|
bin | 1001001100110011100100… |
… | …01010000101010111111001 |
3 | 2122122002021220010221121112 |
4 | 10212121302022011113321 |
5 | 10122432010032211413 |
6 | 111010031244450105 |
7 | 4155441162622622 |
oct | 446316212052771 |
9 | 78562256127545 |
10 | 20231211210233 |
11 | 64a0010335461 |
12 | 2328b3b849935 |
13 | b39a448b5b3a |
14 | 4dd2a5594a49 |
15 | 2513d84362a8 |
hex | 1266722855f9 |
20231211210233 has 2 divisors, whose sum is σ = 20231211210234. Its totient is φ = 20231211210232.
The previous prime is 20231211210131. The next prime is 20231211210313. The reversal of 20231211210233 is 33201211213202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13970946999529 + 6260264210704 = 3737773^2 + 2502052^2 .
It is a cyclic number.
It is not a de Polignac number, because 20231211210233 - 28 = 20231211209977 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20231211210199 and 20231211210208.
It is not a weakly prime, because it can be changed into another prime (20231211210433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10115605605116 + 10115605605117.
It is an arithmetic number, because the mean of its divisors is an integer number (10115605605117).
Almost surely, 220231211210233 is an apocalyptic number.
It is an amenable number.
20231211210233 is a deficient number, since it is larger than the sum of its proper divisors (1).
20231211210233 is an equidigital number, since it uses as much as digits as its factorization.
20231211210233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 20231211210233 its reverse (33201211213202), we get a palindrome (53432422423435).
The spelling of 20231211210233 in words is "twenty trillion, two hundred thirty-one billion, two hundred eleven million, two hundred ten thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •