Base | Representation |
---|---|
bin | 10010101000001110… |
… | …01101111110101001 |
3 | 221210222212011212122 |
4 | 21110013031332221 |
5 | 130440241104001 |
6 | 4332222321025 |
7 | 502560025565 |
oct | 112407157651 |
9 | 27728764778 |
10 | 10001113001 |
11 | 4272405250 |
12 | 1b31429175 |
13 | c34cb9c59 |
14 | 6ac3726a5 |
15 | 3d802cb1b |
hex | 2541cdfa9 |
10001113001 has 8 divisors (see below), whose sum is σ = 10931172384. Its totient is φ = 9074531520.
The previous prime is 10001112997. The next prime is 10001113007. The reversal of 10001113001 is 10031110001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10001113001 - 22 = 10001112997 is a prime.
It is a super-2 number, since 2×100011130012 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10001113001.
It is not an unprimeable number, because it can be changed into a prime (10001113007) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 863456 + ... + 874961.
It is an arithmetic number, because the mean of its divisors is an integer number (1366396548).
Almost surely, 210001113001 is an apocalyptic number.
10001113001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10001113001 is a deficient number, since it is larger than the sum of its proper divisors (930059383).
10001113001 is a wasteful number, since it uses less digits than its factorization.
10001113001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1738951.
The product of its (nonzero) digits is 3, while the sum is 8.
Adding to 10001113001 its reverse (10031110001), we get a palindrome (20032223002).
The spelling of 10001113001 in words is "ten billion, one million, one hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.301 sec. • engine limits •