Base | Representation |
---|---|
bin | 1001100101111100… |
… | …00100110011111011 |
3 | 111021220211020001112 |
4 | 10302332010303323 |
5 | 41021411210411 |
6 | 2211012310535 |
7 | 241424063636 |
oct | 46276046373 |
9 | 14256736045 |
10 | 5150100731 |
11 | 22031089a6 |
12 | bb891244b |
13 | 640c945a9 |
14 | 36bdb4c1d |
15 | 202205b8b |
hex | 132f84cfb |
5150100731 has 2 divisors, whose sum is σ = 5150100732. Its totient is φ = 5150100730.
The previous prime is 5150100667. The next prime is 5150100743. The reversal of 5150100731 is 1370010515.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5150100731 - 26 = 5150100667 is a prime.
It is a super-2 number, since 2×51501007312 = 53047075078893468722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5150100697 and 5150100706.
It is not a weakly prime, because it can be changed into another prime (5150100031) 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, 2575050365 + 2575050366.
It is an arithmetic number, because the mean of its divisors is an integer number (2575050366).
Almost surely, 25150100731 is an apocalyptic number.
5150100731 is a deficient number, since it is larger than the sum of its proper divisors (1).
5150100731 is an equidigital number, since it uses as much as digits as its factorization.
5150100731 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 525, while the sum is 23.
The square root of 5150100731 is about 71764.2022947375. The cubic root of 5150100731 is about 1726.9187617631.
The spelling of 5150100731 in words is "five billion, one hundred fifty million, one hundred thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •