Base | Representation |
---|---|
bin | 10000000110010101100… |
… | …010101011010010111000 |
3 | 10220202121000202220222212 |
4 | 100012111202223102320 |
5 | 121111213231143423 |
6 | 2204122340234252 |
7 | 142633346340155 |
oct | 20062542532270 |
9 | 3822530686885 |
10 | 1106315490488 |
11 | 39720528651a |
12 | 15a4b299b988 |
13 | 8042c3367b0 |
14 | 3b79015d22c |
15 | 1dba0157578 |
hex | 101958ab4b8 |
1106315490488 has 32 divisors (see below), whose sum is σ = 2233950222000. Its totient is φ = 510597105408.
The previous prime is 1106315490461. The next prime is 1106315490541. The reversal of 1106315490488 is 8840945136011.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 8991995 + ... + 9114197.
Almost surely, 21106315490488 is an apocalyptic number.
It is an amenable number.
1106315490488 is an abundant number, since it is smaller than the sum of its proper divisors (1127634731512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1106315490488 is a wasteful number, since it uses less digits than its factorization.
1106315490488 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 209271 (or 209267 counting only the distinct ones).
The product of its (nonzero) digits is 829440, while the sum is 50.
The spelling of 1106315490488 in words is "one trillion, one hundred six billion, three hundred fifteen million, four hundred ninety thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •