Base | Representation |
---|---|
bin | 100101000110111001010… |
… | …1110101001010001000111 |
3 | 200001120010022202002002112 |
4 | 1022031302232221101013 |
5 | 1132024401024320011 |
6 | 14502533040531235 |
7 | 1034316006214523 |
oct | 112156256512107 |
9 | 20046108662075 |
10 | 5100051010631 |
11 | 1696a12923705 |
12 | 6a4510920b1b |
13 | 2acc183240c5 |
14 | 138bb54c4d83 |
15 | 8c9e618558b |
hex | 4a372ba9447 |
5100051010631 has 2 divisors, whose sum is σ = 5100051010632. Its totient is φ = 5100051010630.
The previous prime is 5100051010609. The next prime is 5100051010669. The reversal of 5100051010631 is 1360101500015.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5100051010631 - 26 = 5100051010567 is a prime.
It is a super-2 number, since 2×51000510106312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5100051010597 and 5100051010606.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5100051010531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2550025505315 + 2550025505316.
It is an arithmetic number, because the mean of its divisors is an integer number (2550025505316).
Almost surely, 25100051010631 is an apocalyptic number.
5100051010631 is a deficient number, since it is larger than the sum of its proper divisors (1).
5100051010631 is an equidigital number, since it uses as much as digits as its factorization.
5100051010631 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 5100051010631 its reverse (1360101500015), we get a palindrome (6460152510646).
The spelling of 5100051010631 in words is "five trillion, one hundred billion, fifty-one million, ten thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •