Base | Representation |
---|---|
bin | 10000000101000111101… |
… | …010111011101110110001 |
3 | 10220122012222102222000122 |
4 | 100011013222323232301 |
5 | 121101024303011423 |
6 | 2203344550300025 |
7 | 142556103540500 |
oct | 20050752735661 |
9 | 3818188388018 |
10 | 1105009032113 |
11 | 3966a4877a58 |
12 | 15a1a9357615 |
13 | 80281779cbc |
14 | 3b6a883a837 |
15 | 1db255dd8c8 |
hex | 10147abbbb1 |
1105009032113 has 24 divisors (see below), whose sum is σ = 1319094383040. Its totient is φ = 922594065120.
The previous prime is 1105009032079. The next prime is 1105009032121. The reversal of 1105009032113 is 3112309005011.
It is not a de Polignac number, because 1105009032113 - 216 = 1105008966577 is a prime.
It is a super-2 number, since 2×11050090321132 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1105009032133) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1169573 + ... + 1891538.
It is an arithmetic number, because the mean of its divisors is an integer number (54962265960).
Almost surely, 21105009032113 is an apocalyptic number.
It is an amenable number.
1105009032113 is a deficient number, since it is larger than the sum of its proper divisors (214085350927).
1105009032113 is a wasteful number, since it uses less digits than its factorization.
1105009032113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3061317 (or 3061310 counting only the distinct ones).
The product of its (nonzero) digits is 810, while the sum is 26.
The spelling of 1105009032113 in words is "one trillion, one hundred five billion, nine million, thirty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •