Base | Representation |
---|---|
bin | 101101111100111110011100… |
… | …101100011100110011111011 |
3 | 222111120210101211020000022022 |
4 | 231330332130230130303323 |
5 | 202442221020120330243 |
6 | 1553500304412145055 |
7 | 60366260525133326 |
oct | 5574763454346373 |
9 | 874523354200268 |
10 | 202102315011323 |
11 | 5943a124033531 |
12 | 1a80094846818b |
13 | 88a0221b3266c |
14 | 37c9b38b8d7bd |
15 | 1857229640b68 |
hex | b7cf9cb1ccfb |
202102315011323 has 2 divisors, whose sum is σ = 202102315011324. Its totient is φ = 202102315011322.
The previous prime is 202102315011307. The next prime is 202102315011347. The reversal of 202102315011323 is 323110513201202.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 202102315011323 - 24 = 202102315011307 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 202102315011292 and 202102315011301.
It is not a weakly prime, because it can be changed into another prime (202102315011353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101051157505661 + 101051157505662.
It is an arithmetic number, because the mean of its divisors is an integer number (101051157505662).
Almost surely, 2202102315011323 is an apocalyptic number.
202102315011323 is a deficient number, since it is larger than the sum of its proper divisors (1).
202102315011323 is an equidigital number, since it uses as much as digits as its factorization.
202102315011323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 202102315011323 its reverse (323110513201202), we get a palindrome (525212828212525).
The spelling of 202102315011323 in words is "two hundred two trillion, one hundred two billion, three hundred fifteen million, eleven thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.686 sec. • engine limits •