Base | Representation |
---|---|
bin | 1001001101001000000010… |
… | …0100011111111111000101 |
3 | 1022211120022212020201022210 |
4 | 2103102000210133333011 |
5 | 2311311003100014341 |
6 | 33305322534214033 |
7 | 2063140202356326 |
oct | 223220044377705 |
9 | 38746285221283 |
10 | 10121100001221 |
11 | 3252375104360 |
12 | 1175653ab4319 |
13 | 5855531c3c91 |
14 | 26dc145b444d |
15 | 12841677ec16 |
hex | 9348091ffc5 |
10121100001221 has 16 divisors (see below), whose sum is σ = 14740306011648. Its totient is φ = 6126205830000.
The previous prime is 10121100001189. The next prime is 10121100001247. The reversal of 10121100001221 is 12210000112101.
It is not a de Polignac number, because 10121100001221 - 25 = 10121100001189 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10121100001197 and 10121100001206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10121100001261) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 194827905 + ... + 194879846.
It is an arithmetic number, because the mean of its divisors is an integer number (921269125728).
Almost surely, 210121100001221 is an apocalyptic number.
10121100001221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10121100001221 is a deficient number, since it is larger than the sum of its proper divisors (4619206010427).
10121100001221 is a wasteful number, since it uses less digits than its factorization.
10121100001221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 389708552.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10121100001221 its reverse (12210000112101), we get a palindrome (22331100113322).
The spelling of 10121100001221 in words is "ten trillion, one hundred twenty-one billion, one hundred million, one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •