Base | Representation |
---|---|
bin | 1001001100100010011010… |
… | …0111110111110000101101 |
3 | 1022210121021001012100102202 |
4 | 2103020212213313300231 |
5 | 2311124312224013010 |
6 | 33300532453431245 |
7 | 2062332013315112 |
oct | 223104647676055 |
9 | 38717231170382 |
10 | 10111001001005 |
11 | 3249062520a93 |
12 | 11736b593b525 |
13 | 584603b530c8 |
14 | 26d537240909 |
15 | 128024d686a5 |
hex | 932269f7c2d |
10111001001005 has 32 divisors (see below), whose sum is σ = 12885436267776. Its totient is φ = 7590169027584.
The previous prime is 10111001000981. The next prime is 10111001001061. The reversal of 10111001001005 is 50010010011101.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 10111001001005 - 212 = 10111000996909 is a prime.
It is a super-2 number, since 2×101110010010052 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 372714752 + ... + 372741878.
It is an arithmetic number, because the mean of its divisors is an integer number (402669883368).
Almost surely, 210111001001005 is an apocalyptic number.
It is an amenable number.
10111001001005 is a deficient number, since it is larger than the sum of its proper divisors (2774435266771).
10111001001005 is a wasteful number, since it uses less digits than its factorization.
10111001001005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40133.
The product of its (nonzero) digits is 5, while the sum is 11.
Adding to 10111001001005 its reverse (50010010011101), we get a palindrome (60121011012106).
The spelling of 10111001001005 in words is "ten trillion, one hundred eleven billion, one million, one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •