Base | Representation |
---|---|
bin | 101101111100111110011100… |
… | …011001011100101100101011 |
3 | 222111120210101110211221101102 |
4 | 231330332130121130230223 |
5 | 202442221012331430443 |
6 | 1553500304113312015 |
7 | 60366260434606016 |
oct | 5574763431345453 |
9 | 874523343757342 |
10 | 202102310030123 |
11 | 5943a121241038 |
12 | 1a80094686560b |
13 | 88a0220aaa2c9 |
14 | 37c9b3825437d |
15 | 1857228ea9cb8 |
hex | b7cf9c65cb2b |
202102310030123 has 2 divisors, whose sum is σ = 202102310030124. Its totient is φ = 202102310030122.
The previous prime is 202102310030087. The next prime is 202102310030149. The reversal of 202102310030123 is 321030013201202.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 202102310030123 - 212 = 202102310026027 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 202102310030095 and 202102310030104.
It is not a weakly prime, because it can be changed into another prime (202102310030323) 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, 101051155015061 + 101051155015062.
It is an arithmetic number, because the mean of its divisors is an integer number (101051155015062).
Almost surely, 2202102310030123 is an apocalyptic number.
202102310030123 is a deficient number, since it is larger than the sum of its proper divisors (1).
202102310030123 is an equidigital number, since it uses as much as digits as its factorization.
202102310030123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 202102310030123 its reverse (321030013201202), we get a palindrome (523132323231325).
The spelling of 202102310030123 in words is "two hundred two trillion, one hundred two billion, three hundred ten million, thirty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •