Base | Representation |
---|---|
bin | 10111001111011001011000… |
… | …010011110101000001010011 |
3 | 111101220110220121102212212122 |
4 | 113033121120103311001103 |
5 | 101344124424001144443 |
6 | 1001220020033244455 |
7 | 30346440142631624 |
oct | 2717313023650123 |
9 | 441813817385778 |
10 | 102213113303123 |
11 | 2a628379850959 |
12 | b569704a0372b |
13 | 45058696bbb34 |
14 | 1b351d91a3a4b |
15 | bc3be70a4968 |
hex | 5cf6584f5053 |
102213113303123 has 2 divisors, whose sum is σ = 102213113303124. Its totient is φ = 102213113303122.
The previous prime is 102213113303117. The next prime is 102213113303141. The reversal of 102213113303123 is 321303311312201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102213113303123 - 242 = 97815066792019 is a prime.
It is a super-2 number, since 2×1022131133031232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102213113303092 and 102213113303101.
It is not a weakly prime, because it can be changed into another prime (102213113303143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51106556651561 + 51106556651562.
It is an arithmetic number, because the mean of its divisors is an integer number (51106556651562).
Almost surely, 2102213113303123 is an apocalyptic number.
102213113303123 is a deficient number, since it is larger than the sum of its proper divisors (1).
102213113303123 is an equidigital number, since it uses as much as digits as its factorization.
102213113303123 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 102213113303123 its reverse (321303311312201), we get a palindrome (423516424615324).
The spelling of 102213113303123 in words is "one hundred two trillion, two hundred thirteen billion, one hundred thirteen million, three hundred three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •