Base | Representation |
---|---|
bin | 10011110001100110… |
… | …100111001100101101 |
3 | 2000210210012102011111 |
4 | 103301212213030231 |
5 | 321441211102034 |
6 | 13430543152021 |
7 | 1351116034336 |
oct | 236146471455 |
9 | 60723172144 |
10 | 21233300269 |
11 | 900670a845 |
12 | 4146ba5611 |
13 | 200505b2cc |
14 | 105600328d |
15 | 844183364 |
hex | 4f19a732d |
21233300269 has 2 divisors, whose sum is σ = 21233300270. Its totient is φ = 21233300268.
The previous prime is 21233300219. The next prime is 21233300303. The reversal of 21233300269 is 96200333212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14223424644 + 7009875625 = 119262^2 + 83725^2 .
It is a cyclic number.
It is not a de Polignac number, because 21233300269 - 27 = 21233300141 is a prime.
It is a super-2 number, since 2×212333002692 (a number of 21 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 21233300269.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21233300219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10616650134 + 10616650135.
It is an arithmetic number, because the mean of its divisors is an integer number (10616650135).
Almost surely, 221233300269 is an apocalyptic number.
It is an amenable number.
21233300269 is a deficient number, since it is larger than the sum of its proper divisors (1).
21233300269 is an equidigital number, since it uses as much as digits as its factorization.
21233300269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 31.
The spelling of 21233300269 in words is "twenty-one billion, two hundred thirty-three million, three hundred thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •