Base | Representation |
---|---|
bin | 101111111110010000… |
… | …110001100011100001 |
3 | 11220221212000000001022 |
4 | 233332100301203201 |
5 | 1320443133403101 |
6 | 35355155415225 |
7 | 3502322414144 |
oct | 577620614341 |
9 | 156855000038 |
10 | 51510450401 |
11 | 1a933340873 |
12 | 9b968b4515 |
13 | 4b1b980867 |
14 | 26c919405b |
15 | 15172a5a1b |
hex | bfe4318e1 |
51510450401 has 2 divisors, whose sum is σ = 51510450402. Its totient is φ = 51510450400.
The previous prime is 51510450373. The next prime is 51510450413. The reversal of 51510450401 is 10405401515.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 43617904801 + 7892545600 = 208849^2 + 88840^2 .
It is a cyclic number.
It is not a de Polignac number, because 51510450401 - 230 = 50436708577 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (51510450421) 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, 25755225200 + 25755225201.
It is an arithmetic number, because the mean of its divisors is an integer number (25755225201).
Almost surely, 251510450401 is an apocalyptic number.
It is an amenable number.
51510450401 is a deficient number, since it is larger than the sum of its proper divisors (1).
51510450401 is an equidigital number, since it uses as much as digits as its factorization.
51510450401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2000, while the sum is 26.
Adding to 51510450401 its reverse (10405401515), we get a palindrome (61915851916).
The spelling of 51510450401 in words is "fifty-one billion, five hundred ten million, four hundred fifty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •