Base | Representation |
---|---|
bin | 1001001100100000100101… |
… | …0110110110101101101101 |
3 | 1022210112222211021222001120 |
4 | 2103020021112312231231 |
5 | 2311122311030013010 |
6 | 33300412033531153 |
7 | 2062313602014201 |
oct | 223101126665555 |
9 | 38715884258046 |
10 | 10110510001005 |
11 | 3248930351467 |
12 | 1173599413ab9 |
13 | 5845561cc66b |
14 | 26d4cbd4cb01 |
15 | 127ee6bcbe70 |
hex | 932095b6b6d |
10110510001005 has 32 divisors (see below), whose sum is σ = 16319162482560. Its totient is φ = 5345015669760.
The previous prime is 10110510000979. The next prime is 10110510001043. The reversal of 10110510001005 is 50010001501101.
10110510001005 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 10110510001005 - 213 = 10110509992813 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5174856 + ... + 6855665.
It is an arithmetic number, because the mean of its divisors is an integer number (509973827580).
Almost surely, 210110510001005 is an apocalyptic number.
10110510001005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10110510001005 is a deficient number, since it is larger than the sum of its proper divisors (6208652481555).
10110510001005 is a wasteful number, since it uses less digits than its factorization.
10110510001005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12031021.
The product of its (nonzero) digits is 25, while the sum is 15.
Adding to 10110510001005 its reverse (50010001501101), we get a palindrome (60120511502106).
The spelling of 10110510001005 in words is "ten trillion, one hundred ten billion, five hundred ten million, one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •