Base | Representation |
---|---|
bin | 1001011000001111101011… |
… | …1010101111001111001001 |
3 | 1100111211102011011201021021 |
4 | 2112003322322233033021 |
5 | 2322423221042242413 |
6 | 33533154440112441 |
7 | 2113012140023434 |
oct | 226037272571711 |
9 | 40454364151237 |
10 | 10312131212233 |
11 | 3316394261654 |
12 | 11a6687a65721 |
13 | 59a578370106 |
14 | 27917748681b |
15 | 12d39764018d |
hex | 960faeaf3c9 |
10312131212233 has 8 divisors (see below), whose sum is σ = 10644872919296. Its totient is φ = 9979395274800.
The previous prime is 10312131212197. The next prime is 10312131212263. The reversal of 10312131212233 is 33221213121301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10312131212233 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10312131212198 and 10312131212207.
It is not an unprimeable number, because it can be changed into a prime (10312131212263) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2348035 + ... + 5112487.
It is an arithmetic number, because the mean of its divisors is an integer number (1330609114912).
Almost surely, 210312131212233 is an apocalyptic number.
It is an amenable number.
10312131212233 is a deficient number, since it is larger than the sum of its proper divisors (332741707063).
10312131212233 is a wasteful number, since it uses less digits than its factorization.
10312131212233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2884815.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 10312131212233 its reverse (33221213121301), we get a palindrome (43533344333534).
The spelling of 10312131212233 in words is "ten trillion, three hundred twelve billion, one hundred thirty-one million, two hundred twelve thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •