Base | Representation |
---|---|
bin | 11101000111001110010… |
… | …01000011001111000001 |
3 | 10112121222100100102101122 |
4 | 32203213021003033001 |
5 | 112342113420301423 |
6 | 2043311453442025 |
7 | 132161423306144 |
oct | 16434711031701 |
9 | 3477870312348 |
10 | 1000310322113 |
11 | 35625810a553 |
12 | 141a49aa0315 |
13 | 7343766b9ab |
14 | 365b574605b |
15 | 1b048b138c8 |
hex | e8e72433c1 |
1000310322113 has 2 divisors, whose sum is σ = 1000310322114. Its totient is φ = 1000310322112.
The previous prime is 1000310322061. The next prime is 1000310322127. The reversal of 1000310322113 is 3112230130001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 998584501264 + 1725820849 = 999292^2 + 41543^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000310322113 - 222 = 1000306127809 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1000310322091 and 1000310322100.
It is not a weakly prime, because it can be changed into another prime (1000310322133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500155161056 + 500155161057.
It is an arithmetic number, because the mean of its divisors is an integer number (500155161057).
Almost surely, 21000310322113 is an apocalyptic number.
It is an amenable number.
1000310322113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000310322113 is an equidigital number, since it uses as much as digits as its factorization.
1000310322113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1000310322113 its reverse (3112230130001), we get a palindrome (4112540452114).
The spelling of 1000310322113 in words is "one trillion, three hundred ten million, three hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •