Base | Representation |
---|---|
bin | 11101001000100000100… |
… | …11110001110010101111 |
3 | 10112200202110222111111020 |
4 | 32210100103301302233 |
5 | 112400022224000421 |
6 | 2043504205225223 |
7 | 132214511053500 |
oct | 16442023616257 |
9 | 3480673874436 |
10 | 1001001000111 |
11 | 356581a72112 |
12 | 142001262213 |
13 | 73517795cb8 |
14 | 3663d374ba7 |
15 | 1b089593dc6 |
hex | e9104f1caf |
1001001000111 has 12 divisors (see below), whose sum is σ = 1552572979992. Its totient is φ = 572000571408.
The previous prime is 1001001000061. The next prime is 1001001000113. The reversal of 1001001000111 is 1110001001001.
1001001000111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1001001000111 - 213 = 1001000991919 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1001001000111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001001000113) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3404765160 + ... + 3404765453.
It is an arithmetic number, because the mean of its divisors is an integer number (129381081666).
Almost surely, 21001001000111 is an apocalyptic number.
1001001000111 is a deficient number, since it is larger than the sum of its proper divisors (551571979881).
1001001000111 is an equidigital number, since it uses as much as digits as its factorization.
1001001000111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6809530630 (or 6809530623 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 1001001000111 its reverse (1110001001001), we get a palindrome (2111002001112).
The spelling of 1001001000111 in words is "one trillion, one billion, one million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •