Base | Representation |
---|---|
bin | 10111010001001001000011… |
… | …111110011011001000010111 |
3 | 111102022221102220011211222201 |
4 | 113101021003332123020113 |
5 | 101403111021443411043 |
6 | 1001351051234505331 |
7 | 30361213624333654 |
oct | 2721110376331027 |
9 | 442287386154881 |
10 | 102333031232023 |
11 | 2a67421634a819 |
12 | b5889b1135247 |
13 | 4513c6a89c207 |
14 | 1b3ad33664c2b |
15 | bc6db4c47c4d |
hex | 5d1243f9b217 |
102333031232023 has 2 divisors, whose sum is σ = 102333031232024. Its totient is φ = 102333031232022.
The previous prime is 102333031231969. The next prime is 102333031232027. The reversal of 102333031232023 is 320232130333201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102333031232023 - 233 = 102324441297431 is a prime.
It is a super-2 number, since 2×1023330312320232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102333031231982 and 102333031232000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102333031232027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51166515616011 + 51166515616012.
It is an arithmetic number, because the mean of its divisors is an integer number (51166515616012).
Almost surely, 2102333031232023 is an apocalyptic number.
102333031232023 is a deficient number, since it is larger than the sum of its proper divisors (1).
102333031232023 is an equidigital number, since it uses as much as digits as its factorization.
102333031232023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 102333031232023 its reverse (320232130333201), we get a palindrome (422565161565224).
The spelling of 102333031232023 in words is "one hundred two trillion, three hundred thirty-three billion, thirty-one million, two hundred thirty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •