Base | Representation |
---|---|
bin | 10000000101001010101… |
… | …101101111100000001001 |
3 | 10220122100112112111010202 |
4 | 100011022231233200021 |
5 | 121101130341200410 |
6 | 2203354013021545 |
7 | 142560263603663 |
oct | 20051255574011 |
9 | 3818315474122 |
10 | 1105060100105 |
11 | 396720688105 |
12 | 15a2024848b5 |
13 | 8028c21a550 |
14 | 3b6b1531533 |
15 | 1db29d29ca5 |
hex | 1014ab6f809 |
1105060100105 has 16 divisors (see below), whose sum is σ = 1428492013200. Its totient is φ = 815807612928.
The previous prime is 1105060100099. The next prime is 1105060100191. The reversal of 1105060100105 is 5010010605011.
It can be written as a sum of positive squares in 8 ways, for example, as 588945735184 + 516114364921 = 767428^2 + 718411^2 .
It is a cyclic number.
It is not a de Polignac number, because 1105060100105 - 26 = 1105060100041 is a prime.
It is a super-2 number, since 2×11050601001052 (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 15 ways as a sum of consecutive naturals, for example, 2240432 + ... + 2688801.
It is an arithmetic number, because the mean of its divisors is an integer number (89280750825).
Almost surely, 21105060100105 is an apocalyptic number.
It is an amenable number.
1105060100105 is a deficient number, since it is larger than the sum of its proper divisors (323431913095).
1105060100105 is a wasteful number, since it uses less digits than its factorization.
1105060100105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4932700.
The product of its (nonzero) digits is 150, while the sum is 20.
Adding to 1105060100105 its reverse (5010010605011), we get a palindrome (6115070705116).
The spelling of 1105060100105 in words is "one trillion, one hundred five billion, sixty million, one hundred thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •