Base | Representation |
---|---|
bin | 100001010011011… |
… | …1110010001100001 |
3 | 2212212210112101000 |
4 | 1002212332101201 |
5 | 4242040402201 |
6 | 302520102213 |
7 | 36456462546 |
oct | 10246762141 |
9 | 2785715330 |
10 | 1117512801 |
11 | 5238969a9 |
12 | 272304969 |
13 | 14a6a2ca2 |
14 | a85babcd |
15 | 68194d86 |
hex | 429be461 |
1117512801 has 8 divisors (see below), whose sum is σ = 1655574560. Its totient is φ = 745008516.
The previous prime is 1117512793. The next prime is 1117512811. The reversal of 1117512801 is 1082157111.
It is not a de Polignac number, because 1117512801 - 23 = 1117512793 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 41389363 = 1117512801 / (1 + 1 + 1 + 7 + 5 + 1 + 2 + 8 + 0 + 1).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1117512811) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20694655 + ... + 20694708.
It is an arithmetic number, because the mean of its divisors is an integer number (206946820).
Almost surely, 21117512801 is an apocalyptic number.
It is an amenable number.
1117512801 is a deficient number, since it is larger than the sum of its proper divisors (538061759).
1117512801 is an equidigital number, since it uses as much as digits as its factorization.
1117512801 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41389372 (or 41389366 counting only the distinct ones).
The product of its (nonzero) digits is 560, while the sum is 27.
The square root of 1117512801 is about 33429.2207656715. The cubic root of 1117512801 is about 1037.7295145400.
Adding to 1117512801 its reverse (1082157111), we get a palindrome (2199669912).
The spelling of 1117512801 in words is "one billion, one hundred seventeen million, five hundred twelve thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •