Base | Representation |
---|---|
bin | 100000110011001… |
… | …0101111000010010 |
3 | 2211200220202101200 |
4 | 1001212111320102 |
5 | 4223221221010 |
6 | 301113012030 |
7 | 36162456162 |
oct | 10146257022 |
9 | 2750822350 |
10 | 1100570130 |
11 | 5152746a0 |
12 | 2686b4016 |
13 | 14702033a |
14 | a624a5a2 |
15 | 66949cc0 |
hex | 41995e12 |
1100570130 has 48 divisors (see below), whose sum is σ = 3121619904. Its totient is φ = 266804640.
The previous prime is 1100570111. The next prime is 1100570179. The reversal of 1100570130 is 310750011.
It is a happy number.
It is a super-3 number, since 3×11005701303 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (18).
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 23 ways as a sum of consecutive naturals, for example, 554854 + ... + 556833.
It is an arithmetic number, because the mean of its divisors is an integer number (65033748).
Almost surely, 21100570130 is an apocalyptic number.
1100570130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1100570130 is an abundant number, since it is smaller than the sum of its proper divisors (2021049774).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100570130 is a wasteful number, since it uses less digits than its factorization.
1100570130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1111711 (or 1111708 counting only the distinct ones).
The product of its (nonzero) digits is 105, while the sum is 18.
The square root of 1100570130 is about 33174.8418232853. The cubic root of 1100570130 is about 1032.4584282480.
The spelling of 1100570130 in words is "one billion, one hundred million, five hundred seventy thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •