Base | Representation |
---|---|
bin | 1100110101001001000011… |
… | …11110100011010100010111 |
3 | 10200220020210211011012210221 |
4 | 12122210201332203110113 |
5 | 12144230200303310033 |
6 | 140001232414255211 |
7 | 5641260300556033 |
oct | 632444176432427 |
9 | 120806724135727 |
10 | 28214210213143 |
11 | 8a98641138979 |
12 | 31b8129ab7507 |
13 | 1298786227ab6 |
14 | 6d7809d751c3 |
15 | 33ddb2a7912d |
hex | 19a921fa3517 |
28214210213143 has 2 divisors, whose sum is σ = 28214210213144. Its totient is φ = 28214210213142.
The previous prime is 28214210213087. The next prime is 28214210213177. The reversal of 28214210213143 is 34131201241282.
It is an a-pointer prime, because the next prime (28214210213177) can be obtained adding 28214210213143 to its sum of digits (34).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 28214210213143 - 213 = 28214210204951 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 28214210213099 and 28214210213108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (28214210213183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 14107105106571 + 14107105106572.
It is an arithmetic number, because the mean of its divisors is an integer number (14107105106572).
Almost surely, 228214210213143 is an apocalyptic number.
28214210213143 is a deficient number, since it is larger than the sum of its proper divisors (1).
28214210213143 is an equidigital number, since it uses as much as digits as its factorization.
28214210213143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18432, while the sum is 34.
The spelling of 28214210213143 in words is "twenty-eight trillion, two hundred fourteen billion, two hundred ten million, two hundred thirteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •