Base | Representation |
---|---|
bin | 1010000110101011111110… |
… | …0111000010110110011001 |
3 | 1110100002212000021021221122 |
4 | 2201222333213002312121 |
5 | 2424011240012023001 |
6 | 35343510311415025 |
7 | 2224446105535361 |
oct | 241527747026631 |
9 | 43302760237848 |
10 | 11110000111001 |
11 | 35a37a7475460 |
12 | 12b5238684475 |
13 | 62788c95c62c |
14 | 2a5a267879a1 |
15 | 143ee37c4b1b |
hex | a1abf9c2d99 |
11110000111001 has 24 divisors (see below), whose sum is σ = 12711139773024. Its totient is φ = 9629399482560.
The previous prime is 11110000110973. The next prime is 11110000111019. The reversal of 11110000111001 is 10011100001111.
It is not a de Polignac number, because 11110000111001 - 210 = 11110000109977 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11110000111001.
It is not an unprimeable number, because it can be changed into a prime (11110000111061) 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, 1323116 + ... + 4895981.
It is an arithmetic number, because the mean of its divisors is an integer number (529630823876).
Almost surely, 211110000111001 is an apocalyptic number.
11110000111001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11110000111001 is a deficient number, since it is larger than the sum of its proper divisors (1601139662023).
11110000111001 is a wasteful number, since it uses less digits than its factorization.
11110000111001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6219461 (or 6219438 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 11110000111001 its reverse (10011100001111), we get a palindrome (21121100112112).
The spelling of 11110000111001 in words is "eleven trillion, one hundred ten billion, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •