Base | Representation |
---|---|
bin | 1001011000001111001101… |
… | …0110101001100100100101 |
3 | 1100111211002022101110221221 |
4 | 2112003303112221210211 |
5 | 2322422441100430313 |
6 | 33533134104140341 |
7 | 2113006036261114 |
oct | 226036326514445 |
9 | 40454068343857 |
10 | 10312004311333 |
11 | 331632966707a |
12 | 11a66514676b1 |
13 | 59a557c9b11a |
14 | 279164691c7b |
15 | 12d38b424c8d |
hex | 960f35a9925 |
10312004311333 has 2 divisors, whose sum is σ = 10312004311334. Its totient is φ = 10312004311332.
The previous prime is 10312004311319. The next prime is 10312004311373. The reversal of 10312004311333 is 33311340021301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6747769936609 + 3564234374724 = 2597647^2 + 1887918^2 .
It is a cyclic number.
It is not a de Polignac number, because 10312004311333 - 213 = 10312004303141 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10312004311298 and 10312004311307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10312004311373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5156002155666 + 5156002155667.
It is an arithmetic number, because the mean of its divisors is an integer number (5156002155667).
Almost surely, 210312004311333 is an apocalyptic number.
It is an amenable number.
10312004311333 is a deficient number, since it is larger than the sum of its proper divisors (1).
10312004311333 is an equidigital number, since it uses as much as digits as its factorization.
10312004311333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 10312004311333 its reverse (33311340021301), we get a palindrome (43623344332634).
The spelling of 10312004311333 in words is "ten trillion, three hundred twelve billion, four million, three hundred eleven thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •