Base | Representation |
---|---|
bin | 10111001110000011110011… |
… | …000111011000110111000111 |
3 | 111101120200201111021220101211 |
4 | 113032003303013120313013 |
5 | 101341123230113330043 |
6 | 1001105501423232251 |
7 | 30340005030122152 |
oct | 2716036307306707 |
9 | 441520644256354 |
10 | 102121221230023 |
11 | 2a5a24040a9296 |
12 | b55393a448687 |
13 | 44c9cb38b0098 |
14 | 1b3099cca2c99 |
15 | bc1619a83a9d |
hex | 5ce0f31d8dc7 |
102121221230023 has 2 divisors, whose sum is σ = 102121221230024. Its totient is φ = 102121221230022.
The previous prime is 102121221229861. The next prime is 102121221230033. The reversal of 102121221230023 is 320032122121201.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102121221230023 is a prime.
It is a super-2 number, since 2×1021212212300232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102121221229976 and 102121221230003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102121221230033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51060610615011 + 51060610615012.
It is an arithmetic number, because the mean of its divisors is an integer number (51060610615012).
Almost surely, 2102121221230023 is an apocalyptic number.
102121221230023 is a deficient number, since it is larger than the sum of its proper divisors (1).
102121221230023 is an equidigital number, since it uses as much as digits as its factorization.
102121221230023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 102121221230023 its reverse (320032122121201), we get a palindrome (422153343351224).
The spelling of 102121221230023 in words is "one hundred two trillion, one hundred twenty-one billion, two hundred twenty-one million, two hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •