Base | Representation |
---|---|
bin | 1001000110001001011100… |
… | …1110110010000111100001 |
3 | 1022102002220021221120010100 |
4 | 2101202113032302013201 |
5 | 2302330000100200001 |
6 | 33134255245253013 |
7 | 2051364403462515 |
oct | 221422716620741 |
9 | 38362807846110 |
10 | 10001221100001 |
11 | 320654864157a |
12 | 1156378864169 |
13 | 57715a1299c1 |
14 | 2680c1392145 |
15 | 12524c24a586 |
hex | 918973b21e1 |
10001221100001 has 24 divisors (see below), whose sum is σ = 14837353943360. Its totient is φ = 6486969144096.
The previous prime is 10001221099981. The next prime is 10001221100029. The reversal of 10001221100001 is 10000112210001.
It is a happy number.
It is not a de Polignac number, because 10001221100001 - 210 = 10001221098977 is a prime.
It is a super-2 number, since 2×100012211000012 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10001221100051) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6381660 + ... + 7792818.
Almost surely, 210001221100001 is an apocalyptic number.
It is an amenable number.
10001221100001 is a deficient number, since it is larger than the sum of its proper divisors (4836132843359).
10001221100001 is a wasteful number, since it uses less digits than its factorization.
10001221100001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1432485 (or 1432482 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10001221100001 its reverse (10000112210001), we get a palindrome (20001333310002).
Subtracting from 10001221100001 its reverse (10000112210001), we obtain a square (1108890000 = 333002).
The spelling of 10001221100001 in words is "ten trillion, one billion, two hundred twenty-one million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •