Base | Representation |
---|---|
bin | 10111011101111011110000… |
… | …101100011101110001101111 |
3 | 111112102222110212111120220211 |
4 | 113131323300230131301233 |
5 | 102012011341142423043 |
6 | 1003302552450523251 |
7 | 30511554053246056 |
oct | 2735736054356157 |
9 | 445388425446824 |
10 | 103212102311023 |
11 | 2a983009025492 |
12 | b6ab244296527 |
13 | 4578b2339c1a4 |
14 | 1b6b6c723b39d |
15 | bdebb4bb7a9d |
hex | 5ddef0b1dc6f |
103212102311023 has 2 divisors, whose sum is σ = 103212102311024. Its totient is φ = 103212102311022.
The previous prime is 103212102311011. The next prime is 103212102311029. The reversal of 103212102311023 is 320113201212301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103212102311023 - 213 = 103212102302831 is a prime.
It is a super-2 number, since 2×1032121023110232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103212102310985 and 103212102311003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103212102311029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51606051155511 + 51606051155512.
It is an arithmetic number, because the mean of its divisors is an integer number (51606051155512).
Almost surely, 2103212102311023 is an apocalyptic number.
103212102311023 is a deficient number, since it is larger than the sum of its proper divisors (1).
103212102311023 is an equidigital number, since it uses as much as digits as its factorization.
103212102311023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 103212102311023 its reverse (320113201212301), we get a palindrome (423325303523324).
The spelling of 103212102311023 in words is "one hundred three trillion, two hundred twelve billion, one hundred two million, three hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •