Base | Representation |
---|---|
bin | 1001010010111101010110… |
… | …1111001011110010001111 |
3 | 1100012010222212220021021220 |
4 | 2110233111233023302033 |
5 | 2314431222124110411 |
6 | 33423334553054423 |
7 | 2103315444642543 |
oct | 224572557136217 |
9 | 40163885807256 |
10 | 10221313113231 |
11 | 329091a868690 |
12 | 1190b610b7413 |
13 | 591b33bcbbac |
14 | 2749dda6ba23 |
15 | 12ad2e563b06 |
hex | 94bd5bcbc8f |
10221313113231 has 32 divisors (see below), whose sum is σ = 16167372588288. Its totient is φ = 5672762288640.
The previous prime is 10221313113217. The next prime is 10221313113239. The reversal of 10221313113231 is 13231131312201.
It is not a de Polignac number, because 10221313113231 - 234 = 10204133244047 is a prime.
It is a super-2 number, since 2×102213131132312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10221313113239) 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, 246192885 + ... + 246234398.
It is an arithmetic number, because the mean of its divisors is an integer number (505230393384).
Almost surely, 210221313113231 is an apocalyptic number.
10221313113231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10221313113231 is a deficient number, since it is larger than the sum of its proper divisors (5946059475057).
10221313113231 is a wasteful number, since it uses less digits than its factorization.
10221313113231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 492427351.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 10221313113231 its reverse (13231131312201), we get a palindrome (23452444425432).
The spelling of 10221313113231 in words is "ten trillion, two hundred twenty-one billion, three hundred thirteen million, one hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •