Base | Representation |
---|---|
bin | 10000000101001010011… |
… | …110000111111101111111 |
3 | 10220122100020211111002210 |
4 | 100011022132013331333 |
5 | 121101123314143030 |
6 | 2203353345151503 |
7 | 142560214032603 |
oct | 20051236077577 |
9 | 3818306744083 |
10 | 1105056006015 |
11 | 396719341165 |
12 | 15a20102b593 |
13 | 8028b415c00 |
14 | 3b6b0b87503 |
15 | 1db297bbbb0 |
hex | 1014a787f7f |
1105056006015 has 48 divisors (see below), whose sum is σ = 1997800353792. Its totient is φ = 520374172032.
The previous prime is 1105056005971. The next prime is 1105056006053. The reversal of 1105056006015 is 5106006505011.
It is not a de Polignac number, because 1105056006015 - 29 = 1105056005503 is a prime.
It is a super-2 number, since 2×11050560060152 (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 (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9418207 + ... + 9534816.
It is an arithmetic number, because the mean of its divisors is an integer number (41620840704).
Almost surely, 21105056006015 is an apocalyptic number.
1105056006015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1105056006015 is a deficient number, since it is larger than the sum of its proper divisors (892744347777).
1105056006015 is a wasteful number, since it uses less digits than its factorization.
1105056006015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18953080 (or 18953067 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 30.
The spelling of 1105056006015 in words is "one trillion, one hundred five billion, fifty-six million, six thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •