Base | Representation |
---|---|
bin | 10111001111001110011010… |
… | …000110001001101111000011 |
3 | 111101212100111120001101022122 |
4 | 113033032122012021233003 |
5 | 101343431312010043243 |
6 | 1001210351021354455 |
7 | 30345542166311603 |
oct | 2717163206115703 |
9 | 441770446041278 |
10 | 102201332112323 |
11 | 2a623383659934 |
12 | b567377408a2b |
13 | 450470c998a12 |
14 | 1b347dc662c03 |
15 | bc3757b56668 |
hex | 5cf39a189bc3 |
102201332112323 has 2 divisors, whose sum is σ = 102201332112324. Its totient is φ = 102201332112322.
The previous prime is 102201332112263. The next prime is 102201332112547. The reversal of 102201332112323 is 323211233102201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102201332112323 - 228 = 102201063676867 is a prime.
It is a super-2 number, since 2×1022013321123232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102201332112292 and 102201332112301.
It is not a weakly prime, because it can be changed into another prime (102201332112223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51100666056161 + 51100666056162.
It is an arithmetic number, because the mean of its divisors is an integer number (51100666056162).
Almost surely, 2102201332112323 is an apocalyptic number.
102201332112323 is a deficient number, since it is larger than the sum of its proper divisors (1).
102201332112323 is an equidigital number, since it uses as much as digits as its factorization.
102201332112323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 102201332112323 its reverse (323211233102201), we get a palindrome (425412565214524).
The spelling of 102201332112323 in words is "one hundred two trillion, two hundred one billion, three hundred thirty-two million, one hundred twelve thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •