Base | Representation |
---|---|
bin | 101101111111110110101001… |
… | …101110010100100000011111 |
3 | 222112021200220221112012112222 |
4 | 231333312221232110200133 |
5 | 203003441102114213043 |
6 | 1554131214532015555 |
7 | 60416462055510653 |
oct | 5577665156244037 |
9 | 875250827465488 |
10 | 202300102101023 |
11 | 59505a9a757443 |
12 | 1a833146a615bb |
13 | 88b5a8284ca54 |
14 | 37d553cdd2a63 |
15 | 185c453697d68 |
hex | b7fda9b9481f |
202300102101023 has 2 divisors, whose sum is σ = 202300102101024. Its totient is φ = 202300102101022.
The previous prime is 202300102100959. The next prime is 202300102101121. The reversal of 202300102101023 is 320101201003202.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 202300102101023 - 26 = 202300102100959 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 202300102100992 and 202300102101010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202300102101623) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101150051050511 + 101150051050512.
It is an arithmetic number, because the mean of its divisors is an integer number (101150051050512).
Almost surely, 2202300102101023 is an apocalyptic number.
202300102101023 is a deficient number, since it is larger than the sum of its proper divisors (1).
202300102101023 is an equidigital number, since it uses as much as digits as its factorization.
202300102101023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 202300102101023 its reverse (320101201003202), we get a palindrome (522401303104225).
The spelling of 202300102101023 in words is "two hundred two trillion, three hundred billion, one hundred two million, one hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •