Base | Representation |
---|---|
bin | 11001001111011010000111… |
… | …100111011101010000000001 |
3 | 112120001110012202201211201112 |
4 | 121033122013213131100001 |
5 | 104022241440000000001 |
6 | 1032033142345013105 |
7 | 32245131200050544 |
oct | 3117320747352001 |
9 | 476043182654645 |
10 | 111010000000001 |
11 | 3240a092a800a3 |
12 | 1054a594484195 |
13 | 49c327625745b |
14 | 1d5acac50a85b |
15 | cc7958d36cbb |
hex | 64f6879dd401 |
111010000000001 has 2 divisors, whose sum is σ = 111010000000002. Its totient is φ = 111010000000000.
The previous prime is 111009999999971. The next prime is 111010000000033. The reversal of 111010000000001 is 100000000010111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 107737341715600 + 3272658284401 = 10379660^2 + 1809049^2 .
It is a cyclic number.
It is not a de Polignac number, because 111010000000001 - 242 = 106611953488897 is a prime.
It is not a weakly prime, because it can be changed into another prime (111010000000061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55505000000000 + 55505000000001.
It is an arithmetic number, because the mean of its divisors is an integer number (55505000000001).
Almost surely, 2111010000000001 is an apocalyptic number.
It is an amenable number.
111010000000001 is a deficient number, since it is larger than the sum of its proper divisors (1).
111010000000001 is an equidigital number, since it uses as much as digits as its factorization.
111010000000001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 111010000000001 its reverse (100000000010111), we get a palindrome (211010000010112).
The spelling of 111010000000001 in words is "one hundred eleven trillion, ten billion, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •