Base | Representation |
---|---|
bin | 10010110101001101… |
… | …10011001001011101 |
3 | 222002120212000012200 |
4 | 21122212303021131 |
5 | 131201133230010 |
6 | 4351113322113 |
7 | 505352023011 |
oct | 113246631135 |
9 | 28076760180 |
10 | 10110055005 |
11 | 4318953a66 |
12 | 1b61a06339 |
13 | c5174188b |
14 | 6bca10541 |
15 | 3e289bcc0 |
hex | 25a9b325d |
10110055005 has 24 divisors (see below), whose sum is σ = 17562144600. Its totient is φ = 5380321920.
The previous prime is 10110055003. The next prime is 10110055013. The reversal of 10110055005 is 50055001101.
10110055005 is a `hidden beast` number, since 1 + 0 + 110 + 0 + 550 + 0 + 5 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 195272676 + 9914782329 = 13974^2 + 99573^2 .
It is not a de Polignac number, because 10110055005 - 21 = 10110055003 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10110055001) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 222930 + ... + 264419.
It is an arithmetic number, because the mean of its divisors is an integer number (731756025).
Almost surely, 210110055005 is an apocalyptic number.
10110055005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10110055005 is a deficient number, since it is larger than the sum of its proper divisors (7452089595).
10110055005 is a wasteful number, since it uses less digits than its factorization.
10110055005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 487821 (or 487818 counting only the distinct ones).
The product of its (nonzero) digits is 125, while the sum is 18.
Adding to 10110055005 its reverse (50055001101), we get a palindrome (60165056106).
The spelling of 10110055005 in words is "ten billion, one hundred ten million, fifty-five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •