Base | Representation |
---|---|
bin | 100001010001000… |
… | …0100000000100010 |
3 | 2212210101010121210 |
4 | 1002202010000202 |
5 | 4241223204240 |
6 | 302432330550 |
7 | 36442521645 |
oct | 10242040042 |
9 | 2783333553 |
10 | 1116225570 |
11 | 523097879 |
12 | 2719a3a56 |
13 | 14a342105 |
14 | a8363a5c |
15 | 67edd780 |
hex | 42884022 |
1116225570 has 16 divisors (see below), whose sum is σ = 2678941440. Its totient is φ = 297660144.
The previous prime is 1116225493. The next prime is 1116225571. The reversal of 1116225570 is 755226111.
It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 37207519 = 1116225570 / (1 + 1 + 1 + 6 + 2 + 2 + 5 + 5 + 7 + 0).
It is not an unprimeable number, because it can be changed into a prime (1116225571) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18603730 + ... + 18603789.
It is an arithmetic number, because the mean of its divisors is an integer number (167433840).
Almost surely, 21116225570 is an apocalyptic number.
1116225570 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1116225570 is an abundant number, since it is smaller than the sum of its proper divisors (1562715870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1116225570 is a wasteful number, since it uses less digits than its factorization.
1116225570 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37207529.
The product of its (nonzero) digits is 4200, while the sum is 30.
The square root of 1116225570 is about 33409.9621370633. The cubic root of 1116225570 is about 1037.3309178179.
The spelling of 1116225570 in words is "one billion, one hundred sixteen million, two hundred twenty-five thousand, five hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •