Base | Representation |
---|---|
bin | 10000000110000101110… |
… | …010001000000011101000 |
3 | 10220201220121021202021202 |
4 | 100012011302020003220 |
5 | 121110143040330000 |
6 | 2204040213423332 |
7 | 142623656162042 |
oct | 20060562100350 |
9 | 3821817252252 |
10 | 1106051105000 |
11 | 39708a017816 |
12 | 15a43a33ab48 |
13 | 803b962838a |
14 | 3b766dbaa92 |
15 | 1db86d30dd5 |
hex | 10185c880e8 |
1106051105000 has 80 divisors (see below), whose sum is σ = 2626978300980. Its totient is φ = 436359744000.
The previous prime is 1106051104987. The next prime is 1106051105059. The reversal of 1106051105000 is 5011506011.
It can be written as a sum of positive squares in 10 ways, for example, as 99829457764 + 1006221647236 = 315958^2 + 1003106^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1150139 + ... + 1880138.
Almost surely, 21106051105000 is an apocalyptic number.
1106051105000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1106051105000 is an abundant number, since it is smaller than the sum of its proper divisors (1520927195980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1106051105000 is an equidigital number, since it uses as much as digits as its factorization.
1106051105000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3030376 (or 3030357 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 20.
The spelling of 1106051105000 in words is "one trillion, one hundred six billion, fifty-one million, one hundred five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •