Base | Representation |
---|---|
bin | 10010101000110100… |
… | …00100101001010001 |
3 | 221211100011021201100 |
4 | 21110122010221101 |
5 | 130443022234010 |
6 | 4332520255013 |
7 | 502650032325 |
oct | 112432045121 |
9 | 27740137640 |
10 | 10006055505 |
11 | 4275180666 |
12 | 1b33011469 |
13 | c3602a804 |
14 | 6acc9b985 |
15 | 3d86a72c0 |
hex | 254684a51 |
10006055505 has 12 divisors (see below), whose sum is σ = 17343829620. Its totient is φ = 5336562912.
The previous prime is 10006055491. The next prime is 10006055561. The reversal of 10006055505 is 50555060001.
10006055505 is a `hidden beast` number, since 1 + 0 + 0 + 0 + 605 + 5 + 50 + 5 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 6747472449 + 3258583056 = 82143^2 + 57084^2 .
It is not a de Polignac number, because 10006055505 - 26 = 10006055441 is a prime.
It is a super-2 number, since 2×100060555052 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 111178350 + ... + 111178439.
It is an arithmetic number, because the mean of its divisors is an integer number (1445319135).
Almost surely, 210006055505 is an apocalyptic number.
10006055505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10006055505 is a deficient number, since it is larger than the sum of its proper divisors (7337774115).
10006055505 is a wasteful number, since it uses less digits than its factorization.
10006055505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222356800 (or 222356797 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The spelling of 10006055505 in words is "ten billion, six million, fifty-five thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •