Base | Representation |
---|---|
bin | 10111001100101111111000… |
… | …110011010111101010100011 |
3 | 111101021002011100022200010201 |
4 | 113030233320303113222203 |
5 | 101333134214304113243 |
6 | 1001000241151210031 |
7 | 30330335220124132 |
oct | 2714577063275243 |
9 | 441232140280121 |
10 | 102031122332323 |
11 | 2a568179679968 |
12 | b53a394516917 |
13 | 44c1655441c72 |
14 | 1b2a492bbd919 |
15 | bbe0e4bbe04d |
hex | 5ccbf8cd7aa3 |
102031122332323 has 2 divisors, whose sum is σ = 102031122332324. Its totient is φ = 102031122332322.
The previous prime is 102031122332297. The next prime is 102031122332329. The reversal of 102031122332323 is 323233221130201.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102031122332323 - 25 = 102031122332291 is a prime.
It is a super-2 number, since 2×1020311223323232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102031122332291 and 102031122332300.
It is not a weakly prime, because it can be changed into another prime (102031122332329) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51015561166161 + 51015561166162.
It is an arithmetic number, because the mean of its divisors is an integer number (51015561166162).
Almost surely, 2102031122332323 is an apocalyptic number.
102031122332323 is a deficient number, since it is larger than the sum of its proper divisors (1).
102031122332323 is an equidigital number, since it uses as much as digits as its factorization.
102031122332323 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 102031122332323 its reverse (323233221130201), we get a palindrome (425264343462524).
The spelling of 102031122332323 in words is "one hundred two trillion, thirty-one billion, one hundred twenty-two million, three hundred thirty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •