Base | Representation |
---|---|
bin | 1001001100100110100001… |
… | …0000001111000011100101 |
3 | 1022210201002210010000222020 |
4 | 2103021220100033003211 |
5 | 2311134041114214341 |
6 | 33301234030053353 |
7 | 2062401213442611 |
oct | 223115020170345 |
9 | 38721083100866 |
10 | 10112102101221 |
11 | 324957801796a |
12 | 117396264a259 |
13 | 58474acca7b3 |
14 | 26d5dd588341 |
15 | 12808b86a566 |
hex | 9326840f0e5 |
10112102101221 has 8 divisors (see below), whose sum is σ = 13491120391584. Its totient is φ = 6737242605840.
The previous prime is 10112102101219. The next prime is 10112102101253. The reversal of 10112102101221 is 12210120121101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10112102101221 - 21 = 10112102101219 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10112102101221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10112102101261) 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, 1039693071 + ... + 1039702796.
It is an arithmetic number, because the mean of its divisors is an integer number (1686390048948).
Almost surely, 210112102101221 is an apocalyptic number.
It is an amenable number.
10112102101221 is a deficient number, since it is larger than the sum of its proper divisors (3379018290363).
10112102101221 is a wasteful number, since it uses less digits than its factorization.
10112102101221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2079397491.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10112102101221 its reverse (12210120121101), we get a palindrome (22322222222322).
The spelling of 10112102101221 in words is "ten trillion, one hundred twelve billion, one hundred two million, one hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •