Base | Representation |
---|---|
bin | 1001111111001001… |
… | …11001011010000111 |
3 | 111211122210201022111 |
4 | 10333210321122013 |
5 | 41440032313411 |
6 | 2244005441451 |
7 | 246602612134 |
oct | 47744713207 |
9 | 14748721274 |
10 | 5361604231 |
11 | 2301538685 |
12 | 1057710287 |
13 | 675a488a9 |
14 | 38c10d58b |
15 | 215a83721 |
hex | 13f939687 |
5361604231 has 2 divisors, whose sum is σ = 5361604232. Its totient is φ = 5361604230.
The previous prime is 5361604169. The next prime is 5361604249. The reversal of 5361604231 is 1324061635.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5361604231 - 215 = 5361571463 is a prime.
It is a super-2 number, since 2×53616042312 = 57493599859754202722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5361604193 and 5361604202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5361604271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2680802115 + 2680802116.
It is an arithmetic number, because the mean of its divisors is an integer number (2680802116).
Almost surely, 25361604231 is an apocalyptic number.
5361604231 is a deficient number, since it is larger than the sum of its proper divisors (1).
5361604231 is an equidigital number, since it uses as much as digits as its factorization.
5361604231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 31.
The square root of 5361604231 is about 73222.9761140586. The cubic root of 5361604231 is about 1750.2426037539.
Adding to 5361604231 its reverse (1324061635), we get a palindrome (6685665866).
The spelling of 5361604231 in words is "five billion, three hundred sixty-one million, six hundred four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •