Base | Representation |
---|---|
bin | 100001010010101… |
… | …1111001111001011 |
3 | 2212212001202101121 |
4 | 1002211133033023 |
5 | 4241440423111 |
6 | 302503500111 |
7 | 36453251626 |
oct | 10245371713 |
9 | 2785052347 |
10 | 1117123531 |
11 | 523650497 |
12 | 272157637 |
13 | 14a597a54 |
14 | a8518dbd |
15 | 68119871 |
hex | 4295f3cb |
1117123531 has 4 divisors (see below), whose sum is σ = 1143103192. Its totient is φ = 1091143872.
The previous prime is 1117123463. The next prime is 1117123543. The reversal of 1117123531 is 1353217111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1117123531 - 29 = 1117123019 is a prime.
It is a super-2 number, since 2×11171235312 = 2495929967027815922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1117123496 and 1117123505.
It is not an unprimeable number, because it can be changed into a prime (1117123571) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12989766 + ... + 12989851.
It is an arithmetic number, because the mean of its divisors is an integer number (285775798).
Almost surely, 21117123531 is an apocalyptic number.
1117123531 is a deficient number, since it is larger than the sum of its proper divisors (25979661).
1117123531 is an equidigital number, since it uses as much as digits as its factorization.
1117123531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25979660.
The product of its digits is 630, while the sum is 25.
The square root of 1117123531 is about 33423.3979571198. The cubic root of 1117123531 is about 1037.6090076784.
The spelling of 1117123531 in words is "one billion, one hundred seventeen million, one hundred twenty-three thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •