Base | Representation |
---|---|
bin | 11101010010000001000… |
… | …11111001100101100101 |
3 | 10120011221012222221221212 |
4 | 32221000203321211211 |
5 | 112441001002000010 |
6 | 2050110512321205 |
7 | 132455142434414 |
oct | 16510043714545 |
9 | 3504835887855 |
10 | 1006105500005 |
11 | 358761364471 |
12 | 142ba6843205 |
13 | 73b4c182638 |
14 | 369a527947b |
15 | 1b28778d505 |
hex | ea408f9965 |
1006105500005 has 8 divisors (see below), whose sum is σ = 1211814804600. Its totient is φ = 801892263616.
The previous prime is 1006105499983. The next prime is 1006105500019. The reversal of 1006105500005 is 5000055016001.
It can be written as a sum of positive squares in 4 ways, for example, as 38288314276 + 967817185729 = 195674^2 + 983777^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1006105500005 - 222 = 1006101305701 is a prime.
It is a super-2 number, since 2×10061055000052 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 374015570 + ... + 374018259.
It is an arithmetic number, because the mean of its divisors is an integer number (151476850575).
Almost surely, 21006105500005 is an apocalyptic number.
It is an amenable number.
1006105500005 is a deficient number, since it is larger than the sum of its proper divisors (205709304595).
1006105500005 is an equidigital number, since it uses as much as digits as its factorization.
1006105500005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 748034103.
The product of its (nonzero) digits is 750, while the sum is 23.
The spelling of 1006105500005 in words is "one trillion, six billion, one hundred five million, five hundred thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •