Base | Representation |
---|---|
bin | 1001000110101010101001… |
… | …0100001100101001101110 |
3 | 1022102221220020220121110120 |
4 | 2101222222110030221232 |
5 | 2303001222043033402 |
6 | 33142331340145410 |
7 | 2052131245324125 |
oct | 221525224145156 |
9 | 38387806817416 |
10 | 10010131221102 |
11 | 320a300124421 |
12 | 1158044838266 |
13 | 577c4a09b1cc |
14 | 2686c888cabc |
15 | 1255be5c13bc |
hex | 91aaa50ca6e |
10010131221102 has 8 divisors (see below), whose sum is σ = 20020262442216. Its totient is φ = 3336710407032.
The previous prime is 10010131221089. The next prime is 10010131221107. The reversal of 10010131221102 is 20112213101001.
It is a sphenic number, since it is the product of 3 distinct primes.
10010131221102 is an admirable number.
It is a super-2 number, since 2×100101312211022 (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 (10010131221107) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 834177601753 + ... + 834177601764.
It is an arithmetic number, because the mean of its divisors is an integer number (2502532805277).
Almost surely, 210010131221102 is an apocalyptic number.
10010131221102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10010131221102 is a wasteful number, since it uses less digits than its factorization.
10010131221102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1668355203522.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 10010131221102 its reverse (20112213101001), we get a palindrome (30122344322103).
The spelling of 10010131221102 in words is "ten trillion, ten billion, one hundred thirty-one million, two hundred twenty-one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •