Base | Representation |
---|---|
bin | 10000001010110011010… |
… | …100010010000101101001 |
3 | 10221012222011111021222022 |
4 | 100022303110102011221 |
5 | 121201023130013001 |
6 | 2210234211234225 |
7 | 143163225115010 |
oct | 20126324220551 |
9 | 3835864437868 |
10 | 1111110001001 |
11 | 3992456a1200 |
12 | 15b4105a8975 |
13 | 80a14738570 |
14 | 3bac6c0da77 |
15 | 1dd8101d11b |
hex | 102b3512169 |
1111110001001 has 24 divisors (see below), whose sum is σ = 1503141834432. Its totient is φ = 799199992800.
The previous prime is 1111110000997. The next prime is 1111110001009. The reversal of 1111110001001 is 1001000111111.
It is not a de Polignac number, because 1111110001001 - 22 = 1111110000997 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1111110001001.
It is not an unprimeable number, because it can be changed into a prime (1111110001009) 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, 50443535 + ... + 50465556.
It is an arithmetic number, because the mean of its divisors is an integer number (62630909768).
Almost surely, 21111110001001 is an apocalyptic number.
1111110001001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1111110001001 is a deficient number, since it is larger than the sum of its proper divisors (392031833431).
1111110001001 is a wasteful number, since it uses less digits than its factorization.
1111110001001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100909133 (or 100909122 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 1111110001001 its reverse (1001000111111), we get a palindrome (2112110112112).
The spelling of 1111110001001 in words is "one trillion, one hundred eleven billion, one hundred ten million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •