Base | Representation |
---|---|
bin | 1001010010011111100001… |
… | …0111010011101101110111 |
3 | 1100011101022201120101001121 |
4 | 2110213320113103231313 |
5 | 2314313321323402411 |
6 | 33415532132404411 |
7 | 2102613124434550 |
oct | 224477027235567 |
9 | 40141281511047 |
10 | 10213304122231 |
11 | 328848aa0a161 |
12 | 118b4a6a76707 |
13 | 59115885b572 |
14 | 274480103327 |
15 | 12aa1138e571 |
hex | 949f85d3b77 |
10213304122231 has 32 divisors (see below), whose sum is σ = 12402714981888. Its totient is φ = 8227843868160.
The previous prime is 10213304122223. The next prime is 10213304122279. The reversal of 10213304122231 is 13222140331201.
It is not a de Polignac number, because 10213304122231 - 23 = 10213304122223 is a prime.
It is a super-2 number, since 2×102133041222312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10213304122196 and 10213304122205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10213304128231) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4767541 + ... + 6569326.
It is an arithmetic number, because the mean of its divisors is an integer number (387584843184).
Almost surely, 210213304122231 is an apocalyptic number.
10213304122231 is a deficient number, since it is larger than the sum of its proper divisors (2189410859657).
10213304122231 is a wasteful number, since it uses less digits than its factorization.
10213304122231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11337031.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 10213304122231 its reverse (13222140331201), we get a palindrome (23435444453432).
The spelling of 10213304122231 in words is "ten trillion, two hundred thirteen billion, three hundred four million, one hundred twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •