Base | Representation |
---|---|
bin | 1001001100010010000101… |
… | …00101110101111000000001 |
3 | 2122120100212222120001110102 |
4 | 10212021002211311320001 |
5 | 10122133200211424413 |
6 | 110553455312012145 |
7 | 4154233523200124 |
oct | 446110245657001 |
9 | 78510788501412 |
10 | 20213233311233 |
11 | 6493425278896 |
12 | 2325562b31055 |
13 | b3813b123091 |
14 | 4dc47ba7c3bb |
15 | 250bd4e96458 |
hex | 126242975e01 |
20213233311233 has 2 divisors, whose sum is σ = 20213233311234. Its totient is φ = 20213233311232.
The previous prime is 20213233311211. The next prime is 20213233311307. The reversal of 20213233311233 is 33211333231202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20094527566864 + 118705744369 = 4482692^2 + 344537^2 .
It is a cyclic number.
It is not a de Polignac number, because 20213233311233 - 216 = 20213233245697 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20213233311196 and 20213233311205.
It is not a weakly prime, because it can be changed into another prime (20213233311203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10106616655616 + 10106616655617.
It is an arithmetic number, because the mean of its divisors is an integer number (10106616655617).
Almost surely, 220213233311233 is an apocalyptic number.
It is an amenable number.
20213233311233 is a deficient number, since it is larger than the sum of its proper divisors (1).
20213233311233 is an equidigital number, since it uses as much as digits as its factorization.
20213233311233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11664, while the sum is 29.
Adding to 20213233311233 its reverse (33211333231202), we get a palindrome (53424566542435).
The spelling of 20213233311233 in words is "twenty trillion, two hundred thirteen billion, two hundred thirty-three million, three hundred eleven thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •