Base | Representation |
---|---|
bin | 101111101000011101… |
… | …001111110101011011 |
3 | 11220000100121222000011 |
4 | 233220131033311123 |
5 | 1314221010341103 |
6 | 35255010422351 |
7 | 3460261052251 |
oct | 575035176533 |
9 | 156010558004 |
10 | 51144621403 |
11 | 1a765895057 |
12 | 9ab42919b7 |
13 | 4a90c448b5 |
14 | 26927665d1 |
15 | 14e50e1d6d |
hex | be874fd5b |
51144621403 has 2 divisors, whose sum is σ = 51144621404. Its totient is φ = 51144621402.
The previous prime is 51144621391. The next prime is 51144621427. The reversal of 51144621403 is 30412644115.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 51144621403 - 229 = 50607750491 is a prime.
It is not a weakly prime, because it can be changed into another prime (51144621433) 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, 25572310701 + 25572310702.
It is an arithmetic number, because the mean of its divisors is an integer number (25572310702).
Almost surely, 251144621403 is an apocalyptic number.
51144621403 is a deficient number, since it is larger than the sum of its proper divisors (1).
51144621403 is an equidigital number, since it uses as much as digits as its factorization.
51144621403 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11520, while the sum is 31.
The spelling of 51144621403 in words is "fifty-one billion, one hundred forty-four million, six hundred twenty-one thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •