Base | Representation |
---|---|
bin | 1010000110101111101100… |
… | …1101010100011000000001 |
3 | 1110100012102200201220210120 |
4 | 2201223323031110120001 |
5 | 2424020312000000001 |
6 | 35344153430450453 |
7 | 2224512636464556 |
oct | 241537315243001 |
9 | 43305380656716 |
10 | 11111000000001 |
11 | 35a416a922900 |
12 | 12b5477503a29 |
13 | 6279bbb5b125 |
14 | 2a5abd4a6a2d |
15 | 144051483236 |
hex | a1afb354601 |
11111000000001 has 24 divisors (see below), whose sum is σ = 16288200865440. Its totient is φ = 6732156625920.
The previous prime is 11110999999969. The next prime is 11111000000003. The reversal of 11111000000001 is 10000000011111.
It is not a de Polignac number, because 11111000000001 - 25 = 11110999999969 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11111000000003) 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, 2678080 + ... + 5421633.
It is an arithmetic number, because the mean of its divisors is an integer number (678675036060).
Almost surely, 211111000000001 is an apocalyptic number.
11111000000001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11111000000001 is a deficient number, since it is larger than the sum of its proper divisors (5177200865439).
11111000000001 is a wasteful number, since it uses less digits than its factorization.
11111000000001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8103517 (or 8103506 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 11111000000001 its reverse (10000000011111), we get a palindrome (21111000011112).
It can be divided in two parts, 1111 and 1000000001, that multiplied together give a palindrome (1111000001111).
The spelling of 11111000000001 in words is "eleven trillion, one hundred eleven billion, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.269 sec. • engine limits •