Base | Representation |
---|---|
bin | 1001000110101010001010… |
… | …0011011100011010101111 |
3 | 1022102221120011212200211220 |
4 | 2101222202203130122233 |
5 | 2303000440224000421 |
6 | 33142310405114423 |
7 | 2052125104423110 |
oct | 221524243343257 |
9 | 38387504780756 |
10 | 10010001000111 |
11 | 320a243671472 |
12 | 11580090b8a13 |
13 | 577c29105c78 |
14 | 2686b5472207 |
15 | 1255b2e4c3c6 |
hex | 91aa28dc6af |
10010001000111 has 64 divisors (see below), whose sum is σ = 15669305005056. Its totient is φ = 5566201804800.
The previous prime is 10010001000107. The next prime is 10010001000179. The reversal of 10010001000111 is 11100010001001.
10010001000111 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 10010001000111 - 22 = 10010001000107 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10010001000111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10010001000211) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 79116681 + ... + 79243101.
It is an arithmetic number, because the mean of its divisors is an integer number (244832890704).
Almost surely, 210010001000111 is an apocalyptic number.
10010001000111 is a deficient number, since it is larger than the sum of its proper divisors (5659304004945).
10010001000111 is a wasteful number, since it uses less digits than its factorization.
10010001000111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 127152.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 10010001000111 its reverse (11100010001001), we get a palindrome (21110011001112).
The spelling of 10010001000111 in words is "ten trillion, ten billion, one million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •