Base | Representation |
---|---|
bin | 100001010010101… |
… | …1011101110100000 |
3 | 2212212001000200001 |
4 | 1002211123232200 |
5 | 4241434443102 |
6 | 302503305344 |
7 | 36453161665 |
oct | 10245335640 |
9 | 2785030601 |
10 | 1117109152 |
11 | 523640705 |
12 | 27214b254 |
13 | 14a591343 |
14 | a8513a6c |
15 | 68115487 |
hex | 4295bba0 |
1117109152 has 12 divisors (see below), whose sum is σ = 2199308706. Its totient is φ = 558554560.
The previous prime is 1117109141. The next prime is 1117109153. The reversal of 1117109152 is 2519017111.
It can be written as a sum of positive squares in only one way, i.e., 797271696 + 319837456 = 28236^2 + 17884^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 1117109152.
It is not an unprimeable number, because it can be changed into a prime (1117109153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 17454799 + ... + 17454862.
Almost surely, 21117109152 is an apocalyptic number.
It is an amenable number.
1117109152 is a deficient number, since it is larger than the sum of its proper divisors (1082199554).
1117109152 is an equidigital number, since it uses as much as digits as its factorization.
1117109152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34909671 (or 34909663 counting only the distinct ones).
The product of its (nonzero) digits is 630, while the sum is 28.
The square root of 1117109152 is about 33423.1828526249. The cubic root of 1117109152 is about 1037.6045558150.
The spelling of 1117109152 in words is "one billion, one hundred seventeen million, one hundred nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •