Base | Representation |
---|---|
bin | 1001001100011111000101… |
… | …0001110000010101111101 |
3 | 1022210111221200010010221222 |
4 | 2103013301101300111331 |
5 | 2311120444114323010 |
6 | 33300304003003125 |
7 | 2062300565113610 |
oct | 223076121602575 |
9 | 38714850103858 |
10 | 10110106011005 |
11 | 3248743300830 |
12 | 11734a60694a5 |
13 | 5844c05c1c20 |
14 | 26d49042a177 |
15 | 127ec14cb355 |
hex | 931f147057d |
10110106011005 has 32 divisors (see below), whose sum is σ = 16289289692928. Its totient is φ = 5817603456000.
The previous prime is 10110106011001. The next prime is 10110106011029. The reversal of 10110106011005 is 50011060101101.
10110106011005 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 10110106011005 - 22 = 10110106011001 is a prime.
It is a super-2 number, since 2×101101060110052 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10110106011001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1009995596 + ... + 1010005605.
It is an arithmetic number, because the mean of its divisors is an integer number (509040302904).
Almost surely, 210110106011005 is an apocalyptic number.
It is an amenable number.
10110106011005 is a deficient number, since it is larger than the sum of its proper divisors (6179183681923).
10110106011005 is a wasteful number, since it uses less digits than its factorization.
10110106011005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2020001237.
The product of its (nonzero) digits is 30, while the sum is 17.
Adding to 10110106011005 its reverse (50011060101101), we get a palindrome (60121166112106).
The spelling of 10110106011005 in words is "ten trillion, one hundred ten billion, one hundred six million, eleven thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.158 sec. • engine limits •