Base | Representation |
---|---|
bin | 100010101100010… |
… | …1010000010001011 |
3 | 10000010102222101011 |
4 | 1011120222002023 |
5 | 4341001412111 |
6 | 311302304351 |
7 | 40563420601 |
oct | 10530520213 |
9 | 3003388334 |
10 | 1164091531 |
11 | 548110219 |
12 | 285a280b7 |
13 | 157231075 |
14 | b0863871 |
15 | 6c2e6021 |
hex | 4562a08b |
1164091531 has 2 divisors, whose sum is σ = 1164091532. Its totient is φ = 1164091530.
The previous prime is 1164091529. The next prime is 1164091543. The reversal of 1164091531 is 1351904611.
It is a weak prime.
It is an emirp because it is prime and its reverse (1351904611) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1164091531 - 21 = 1164091529 is a prime.
It is a super-2 number, since 2×11640915312 = 2710218185091847922, which contains 22 as substring.
Together with 1164091529, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1164091493 and 1164091502.
It is not a weakly prime, because it can be changed into another prime (1164091561) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 582045765 + 582045766.
It is an arithmetic number, because the mean of its divisors is an integer number (582045766).
Almost surely, 21164091531 is an apocalyptic number.
1164091531 is a deficient number, since it is larger than the sum of its proper divisors (1).
1164091531 is an equidigital number, since it uses as much as digits as its factorization.
1164091531 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3240, while the sum is 31.
The square root of 1164091531 is about 34118.7856026559. The cubic root of 1164091531 is about 1051.9514822304.
The spelling of 1164091531 in words is "one billion, one hundred sixty-four million, ninety-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •