Base | Representation |
---|---|
bin | 1001011110011011… |
… | …10111100110001111 |
3 | 111010112100002021001 |
4 | 10233031313212033 |
5 | 40404301211142 |
6 | 2200442521131 |
7 | 240030623524 |
oct | 45715674617 |
9 | 14115302231 |
10 | 5087132047 |
11 | 218060a668 |
12 | b9b8061a7 |
13 | 630c1830a |
14 | 3638a314b |
15 | 1eb9185b7 |
hex | 12f37798f |
5087132047 has 2 divisors, whose sum is σ = 5087132048. Its totient is φ = 5087132046.
The previous prime is 5087132041. The next prime is 5087132051. The reversal of 5087132047 is 7402317805.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5087132047 - 27 = 5087131919 is a prime.
It is a super-2 number, since 2×50871320472 = 51757824927228820418, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5087131997 and 5087132015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5087132041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2543566023 + 2543566024.
It is an arithmetic number, because the mean of its divisors is an integer number (2543566024).
Almost surely, 25087132047 is an apocalyptic number.
5087132047 is a deficient number, since it is larger than the sum of its proper divisors (1).
5087132047 is an equidigital number, since it uses as much as digits as its factorization.
5087132047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 47040, while the sum is 37.
The square root of 5087132047 is about 71324.1336926009. The cubic root of 5087132047 is about 1719.8517141632.
The spelling of 5087132047 in words is "five billion, eighty-seven million, one hundred thirty-two thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •