Base | Representation |
---|---|
bin | 100101011110001110110… |
… | …0001000101011001011111 |
3 | 200020100110120112021210212 |
4 | 1022330131201011121133 |
5 | 1133340012204000111 |
6 | 14541541251523035 |
7 | 1041041535126215 |
oct | 112743541053137 |
9 | 20210416467725 |
10 | 5150161000031 |
11 | 1706197690393 |
12 | 6b21765b947b |
13 | 2b4872ac43c8 |
14 | 13b3aa686cb5 |
15 | 8de7a50498b |
hex | 4af1d84565f |
5150161000031 has 2 divisors, whose sum is σ = 5150161000032. Its totient is φ = 5150161000030.
The previous prime is 5150160999979. The next prime is 5150161000069. The reversal of 5150161000031 is 1300001610515.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5150161000031 - 26 = 5150160999967 is a prime.
It is a super-2 number, since 2×51501610000312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5150160999970 and 5150161000006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5150161000331) 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, 2575080500015 + 2575080500016.
It is an arithmetic number, because the mean of its divisors is an integer number (2575080500016).
Almost surely, 25150161000031 is an apocalyptic number.
5150161000031 is a deficient number, since it is larger than the sum of its proper divisors (1).
5150161000031 is an equidigital number, since it uses as much as digits as its factorization.
5150161000031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 450, while the sum is 23.
Adding to 5150161000031 its reverse (1300001610515), we get a palindrome (6450162610546).
The spelling of 5150161000031 in words is "five trillion, one hundred fifty billion, one hundred sixty-one million, thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •