Base | Representation |
---|---|
bin | 100101011110100111110… |
… | …0110000010110100011101 |
3 | 200020102122010102212222101 |
4 | 1022331033212002310131 |
5 | 1133343222244122424 |
6 | 14542200503245101 |
7 | 1041101416311115 |
oct | 112751746026435 |
9 | 20212563385871 |
10 | 5151001160989 |
11 | 1706588961792 |
12 | 6b236ba49791 |
13 | 2b4977b99178 |
14 | 13b44a0a8045 |
15 | 8dec9161344 |
hex | 4af4f982d1d |
5151001160989 has 2 divisors, whose sum is σ = 5151001160990. Its totient is φ = 5151001160988.
The previous prime is 5151001160953. The next prime is 5151001161013. The reversal of 5151001160989 is 9890611001515.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4281133428100 + 869867732889 = 2069090^2 + 932667^2 .
It is a cyclic number.
It is not a de Polignac number, because 5151001160989 - 27 = 5151001160861 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5151001160909) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2575500580494 + 2575500580495.
It is an arithmetic number, because the mean of its divisors is an integer number (2575500580495).
Almost surely, 25151001160989 is an apocalyptic number.
It is an amenable number.
5151001160989 is a deficient number, since it is larger than the sum of its proper divisors (1).
5151001160989 is an equidigital number, since it uses as much as digits as its factorization.
5151001160989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 97200, while the sum is 46.
The spelling of 5151001160989 in words is "five trillion, one hundred fifty-one billion, one million, one hundred sixty thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •