Base | Representation |
---|---|
bin | 11001001111010000110100… |
… | …010010101001100101110001 |
3 | 112120000111102200202001102101 |
4 | 121033100310102221211301 |
5 | 104022111011044231001 |
6 | 1032024411313420401 |
7 | 32244325530241441 |
oct | 3117206422514561 |
9 | 476014380661371 |
10 | 111000012102001 |
11 | 32405928081540 |
12 | 1054866756a701 |
13 | 49c2343c16539 |
14 | 1d5a601c18121 |
15 | cc7572069a01 |
hex | 64f4344a9971 |
111000012102001 has 8 divisors (see below), whose sum is σ = 123076019380608. Its totient is φ = 99254854338000.
The previous prime is 111000012101999. The next prime is 111000012102043. The reversal of 111000012102001 is 100201210000111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 111000012102001 - 21 = 111000012101999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111000012102101) 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, 82712377945 + ... + 82712379286.
It is an arithmetic number, because the mean of its divisors is an integer number (15384502422576).
Almost surely, 2111000012102001 is an apocalyptic number.
111000012102001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
111000012102001 is a deficient number, since it is larger than the sum of its proper divisors (12076007278607).
111000012102001 is a wasteful number, since it uses less digits than its factorization.
111000012102001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 165424757303.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 111000012102001 its reverse (100201210000111), we get a palindrome (211201222102112).
The spelling of 111000012102001 in words is "one hundred eleven trillion, twelve million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •