Base | Representation |
---|---|
bin | 1001011100001001… |
… | …10101010110101111 |
3 | 111002012022101022012 |
4 | 10232010311112233 |
5 | 40334401030401 |
6 | 2154520311435 |
7 | 236406113261 |
oct | 45604652657 |
9 | 14065271265 |
10 | 5067986351 |
11 | 217082317a |
12 | b9531257b |
13 | 629c739bc |
14 | 36111bb31 |
15 | 1e9dd58bb |
hex | 12e1355af |
5067986351 has 2 divisors, whose sum is σ = 5067986352. Its totient is φ = 5067986350.
The previous prime is 5067986333. The next prime is 5067986369. The reversal of 5067986351 is 1536897605.
It is a happy number.
5067986351 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (5067986333) and next prime (5067986369).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5067986351 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5067986351.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5067986851) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2533993175 + 2533993176.
It is an arithmetic number, because the mean of its divisors is an integer number (2533993176).
Almost surely, 25067986351 is an apocalyptic number.
5067986351 is a deficient number, since it is larger than the sum of its proper divisors (1).
5067986351 is an equidigital number, since it uses as much as digits as its factorization.
5067986351 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1360800, while the sum is 50.
The square root of 5067986351 is about 71189.7910588309. The cubic root of 5067986351 is about 1717.6914168463.
The spelling of 5067986351 in words is "five billion, sixty-seven million, nine hundred eighty-six thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •