Base | Representation |
---|---|
bin | 1001010111101001111111… |
… | …0110000010101101010111 |
3 | 1100110212022000120112102202 |
4 | 2111322133312002231113 |
5 | 2322242010402220043 |
6 | 33524402442355115 |
7 | 2112203331246425 |
oct | 225723766025527 |
9 | 40425260515382 |
10 | 10302013320023 |
11 | 3312071a45467 |
12 | 11a47234bba9b |
13 | 599625116249 |
14 | 2788977d6115 |
15 | 12cea42461b8 |
hex | 95e9fd82b57 |
10302013320023 has 2 divisors, whose sum is σ = 10302013320024. Its totient is φ = 10302013320022.
The previous prime is 10302013319989. The next prime is 10302013320037. The reversal of 10302013320023 is 32002331020301.
It is a strong prime.
It is an emirp because it is prime and its reverse (32002331020301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10302013320023 - 212 = 10302013315927 is a prime.
It is a super-2 number, since 2×103020133200232 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10302013319977 and 10302013320004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10302013326023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5151006660011 + 5151006660012.
It is an arithmetic number, because the mean of its divisors is an integer number (5151006660012).
Almost surely, 210302013320023 is an apocalyptic number.
10302013320023 is a deficient number, since it is larger than the sum of its proper divisors (1).
10302013320023 is an equidigital number, since it uses as much as digits as its factorization.
10302013320023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 10302013320023 its reverse (32002331020301), we get a palindrome (42304344340324).
The spelling of 10302013320023 in words is "ten trillion, three hundred two billion, thirteen million, three hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •