Base | Representation |
---|---|
bin | 1001100110011001000011… |
… | …11001101001110000110001 |
3 | 2202202010110101221010202121 |
4 | 10303030201321221300301 |
5 | 10231332430223134413 |
6 | 112521541512114241 |
7 | 4306112506001521 |
oct | 463144171516061 |
9 | 82663411833677 |
10 | 21110333021233 |
11 | 67a99297108a5 |
12 | 244b3a7995981 |
13 | ba1907a69451 |
14 | 52da61bb5681 |
15 | 2691dca77b8d |
hex | 133321e69c31 |
21110333021233 has 2 divisors, whose sum is σ = 21110333021234. Its totient is φ = 21110333021232.
The previous prime is 21110333021221. The next prime is 21110333021257. The reversal of 21110333021233 is 33212033301112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21104578736784 + 5754284449 = 4593972^2 + 75857^2 .
It is a cyclic number.
It is not a de Polignac number, because 21110333021233 - 237 = 20972894067761 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21110333021198 and 21110333021207.
It is not a weakly prime, because it can be changed into another prime (21110333051233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10555166510616 + 10555166510617.
It is an arithmetic number, because the mean of its divisors is an integer number (10555166510617).
Almost surely, 221110333021233 is an apocalyptic number.
It is an amenable number.
21110333021233 is a deficient number, since it is larger than the sum of its proper divisors (1).
21110333021233 is an equidigital number, since it uses as much as digits as its factorization.
21110333021233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 21110333021233 its reverse (33212033301112), we get a palindrome (54322366322345).
The spelling of 21110333021233 in words is "twenty-one trillion, one hundred ten billion, three hundred thirty-three million, twenty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •