Base | Representation |
---|---|
bin | 1001101001101011000110… |
… | …10110000010001110111001 |
3 | 2210010220112100010211002012 |
4 | 10310311203112002032321 |
5 | 10240204402113131413 |
6 | 113045431350415305 |
7 | 4320214130421251 |
oct | 464654326021671 |
9 | 83126470124065 |
10 | 21223100130233 |
11 | 6842736813951 |
12 | 2469219361535 |
13 | bac439618751 |
14 | 5352bc69a961 |
15 | 26c0dca5e7a8 |
hex | 134d635823b9 |
21223100130233 has 2 divisors, whose sum is σ = 21223100130234. Its totient is φ = 21223100130232.
The previous prime is 21223100130173. The next prime is 21223100130241. The reversal of 21223100130233 is 33203100132212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18739963945024 + 2483136185209 = 4328968^2 + 1575797^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21223100130233 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21223100130199 and 21223100130208.
It is not a weakly prime, because it can be changed into another prime (21223100130283) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10611550065116 + 10611550065117.
It is an arithmetic number, because the mean of its divisors is an integer number (10611550065117).
Almost surely, 221223100130233 is an apocalyptic number.
It is an amenable number.
21223100130233 is a deficient number, since it is larger than the sum of its proper divisors (1).
21223100130233 is an equidigital number, since it uses as much as digits as its factorization.
21223100130233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 21223100130233 its reverse (33203100132212), we get a palindrome (54426200262445).
The spelling of 21223100130233 in words is "twenty-one trillion, two hundred twenty-three billion, one hundred million, one hundred thirty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •