Base | Representation |
---|---|
bin | 11101010000000100000… |
… | …00011010011101111001 |
3 | 10120002020002012100110120 |
4 | 32220002000122131321 |
5 | 112431323314310410 |
6 | 2045414422203453 |
7 | 132420140062200 |
oct | 16500200323571 |
9 | 3502202170416 |
10 | 1005056010105 |
11 | 358272a09144 |
12 | 142953283589 |
13 | 73a129082b4 |
14 | 36905b28237 |
15 | 1b225583570 |
hex | ea0201a779 |
1005056010105 has 48 divisors (see below), whose sum is σ = 1889156136384. Its totient is φ = 454905091200.
The previous prime is 1005056010089. The next prime is 1005056010121. The reversal of 1005056010105 is 5010106505001.
It is an interprime number because it is at equal distance from previous prime (1005056010089) and next prime (1005056010121).
It is not a de Polignac number, because 1005056010105 - 24 = 1005056010089 is a prime.
It is a super-2 number, since 2×10050560101052 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6695187 + ... + 6843656.
It is an arithmetic number, because the mean of its divisors is an integer number (39357419508).
Almost surely, 21005056010105 is an apocalyptic number.
1005056010105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1005056010105 is a deficient number, since it is larger than the sum of its proper divisors (884100126279).
1005056010105 is a wasteful number, since it uses less digits than its factorization.
1005056010105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13538966 (or 13538959 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 24.
The spelling of 1005056010105 in words is "one trillion, five billion, fifty-six million, ten thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •