Base | Representation |
---|---|
bin | 1001001101001100100001… |
… | …0010101110001011011001 |
3 | 1022211200102201110122100211 |
4 | 2103103020102232023121 |
5 | 2311320434121102223 |
6 | 33310042201131121 |
7 | 2063212053265051 |
oct | 223231022561331 |
9 | 38750381418324 |
10 | 10122303300313 |
11 | 3252932363816 |
12 | 117592aa89aa1 |
13 | 5856b55a1c89 |
14 | 26dcca322561 |
15 | 12848721cd0d |
hex | 934c84ae2d9 |
10122303300313 has 2 divisors, whose sum is σ = 10122303300314. Its totient is φ = 10122303300312.
The previous prime is 10122303300259. The next prime is 10122303300341. The reversal of 10122303300313 is 31300330322101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5860093502169 + 4262209798144 = 2420763^2 + 2064512^2 .
It is a cyclic number.
It is not a de Polignac number, because 10122303300313 - 237 = 9984864346841 is a prime.
It is a super-2 number, since 2×101223033003132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10122303300413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5061151650156 + 5061151650157.
It is an arithmetic number, because the mean of its divisors is an integer number (5061151650157).
Almost surely, 210122303300313 is an apocalyptic number.
It is an amenable number.
10122303300313 is a deficient number, since it is larger than the sum of its proper divisors (1).
10122303300313 is an equidigital number, since it uses as much as digits as its factorization.
10122303300313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 10122303300313 its reverse (31300330322101), we get a palindrome (41422633622414).
The spelling of 10122303300313 in words is "ten trillion, one hundred twenty-two billion, three hundred three million, three hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •