Base | Representation |
---|---|
bin | 1001010010111101010100… |
… | …0101010010100110011110 |
3 | 1100012010222010020022122101 |
4 | 2110233111011102212132 |
5 | 2314431211321143402 |
6 | 33423333521435314 |
7 | 2103315252412636 |
oct | 224572505224636 |
9 | 40163863208571 |
10 | 10221302131102 |
11 | 3290914647647 |
12 | 1190b5949bb3a |
13 | 591b318552aa |
14 | 2749dc40d6c6 |
15 | 12ad2d5e4b87 |
hex | 94bd515299e |
10221302131102 has 8 divisors (see below), whose sum is σ = 16138898101800. Its totient is φ = 4841669430504.
The previous prime is 10221302131097. The next prime is 10221302131127. The reversal of 10221302131102 is 20113120312201.
10221302131102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a self number, because there is not a number n which added to its sum of digits gives 10221302131102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 134490817477 + ... + 134490817552.
It is an arithmetic number, because the mean of its divisors is an integer number (2017362262725).
Almost surely, 210221302131102 is an apocalyptic number.
10221302131102 is a deficient number, since it is larger than the sum of its proper divisors (5917595970698).
10221302131102 is a wasteful number, since it uses less digits than its factorization.
10221302131102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 268981635050.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 10221302131102 its reverse (20113120312201), we get a palindrome (30334422443303).
The spelling of 10221302131102 in words is "ten trillion, two hundred twenty-one billion, three hundred two million, one hundred thirty-one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •