Base | Representation |
---|---|
bin | 10000001010101101010… |
… | …111010001000101000001 |
3 | 10221012201012112211000000 |
4 | 100022231113101011001 |
5 | 121200322042320001 |
6 | 2210220242350213 |
7 | 143160603126525 |
oct | 20125527210501 |
9 | 3835635484000 |
10 | 1111010120001 |
11 | 3991a4281121 |
12 | 15b3a305b369 |
13 | 809c9b36c92 |
14 | 3bab784dd85 |
15 | 1dd7738da86 |
hex | 102ad5d1141 |
1111010120001 has 56 divisors (see below), whose sum is σ = 1676393524224. Its totient is φ = 735951277440.
The previous prime is 1111010119949. The next prime is 1111010120023. The reversal of 1111010120001 is 1000210101111.
It is not a de Polignac number, because 1111010120001 - 239 = 561254306113 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (1111010120081) by changing a digit.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 136032420 + ... + 136040586.
Almost surely, 21111010120001 is an apocalyptic number.
It is an amenable number.
1111010120001 is a deficient number, since it is larger than the sum of its proper divisors (565383404223).
1111010120001 is an frugal number, since it uses more digits than its factorization.
1111010120001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9353 (or 9338 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1111010120001 its reverse (1000210101111), we get a palindrome (2111220221112).
The spelling of 1111010120001 in words is "one trillion, one hundred eleven billion, ten million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •