Base | Representation |
---|---|
bin | 10000101111001011001… |
… | …011100000101000001001 |
3 | 11001221202222110212020211 |
4 | 100233023023200220021 |
5 | 122321014223410410 |
6 | 2240213432521121 |
7 | 146045106463045 |
oct | 20571313405011 |
9 | 4057688425224 |
10 | 1150165060105 |
11 | 403867212156 |
12 | 166aabb501a1 |
13 | 845c9aba9a9 |
14 | 3d94dac3025 |
15 | 1edb9a9c68a |
hex | 10bcb2e0a09 |
1150165060105 has 32 divisors (see below), whose sum is σ = 1432448012160. Its totient is φ = 885862748160.
The previous prime is 1150165060069. The next prime is 1150165060159. The reversal of 1150165060105 is 5010605610511.
It is not a de Polignac number, because 1150165060105 - 225 = 1150131505673 is a prime.
It is a super-2 number, since 2×11501650601052 (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 31 ways as a sum of consecutive naturals, for example, 8341161 + ... + 8477929.
It is an arithmetic number, because the mean of its divisors is an integer number (44764000380).
Almost surely, 21150165060105 is an apocalyptic number.
It is an amenable number.
1150165060105 is a deficient number, since it is larger than the sum of its proper divisors (282282952055).
1150165060105 is a wasteful number, since it uses less digits than its factorization.
1150165060105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137289.
The product of its (nonzero) digits is 4500, while the sum is 31.
The spelling of 1150165060105 in words is "one trillion, one hundred fifty billion, one hundred sixty-five million, sixty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •