Base | Representation |
---|---|
bin | 10000000101001010001… |
… | …011010000011100100101 |
3 | 10220122022220112012110020 |
4 | 100011022023100130211 |
5 | 121101121032410010 |
6 | 2203353051145353 |
7 | 142560124013004 |
oct | 20051213203445 |
9 | 3818286465406 |
10 | 1105051060005 |
11 | 396716573152 |
12 | 15a1bb445259 |
13 | 8028a3a3889 |
14 | 3b6b025ac3b |
15 | 1db29141470 |
hex | 1014a2d0725 |
1105051060005 has 32 divisors (see below), whose sum is σ = 1836270777600. Its totient is φ = 566988820992.
The previous prime is 1105051059977. The next prime is 1105051060037. The reversal of 1105051060005 is 5000601505011.
It is not a de Polignac number, because 1105051060005 - 210 = 1105051058981 is a prime.
It is a super-2 number, since 2×11050510600052 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11136465 + ... + 11235254.
It is an arithmetic number, because the mean of its divisors is an integer number (57383461800).
Almost surely, 21105051060005 is an apocalyptic number.
1105051060005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1105051060005 is a deficient number, since it is larger than the sum of its proper divisors (731219717595).
1105051060005 is a wasteful number, since it uses less digits than its factorization.
1105051060005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22371853.
The product of its (nonzero) digits is 750, while the sum is 24.
Adding to 1105051060005 its reverse (5000601505011), we get a palindrome (6105652565016).
The spelling of 1105051060005 in words is "one trillion, one hundred five billion, fifty-one million, sixty thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •