Base | Representation |
---|---|
bin | 101111101000010011… |
… | …110011000000000001 |
3 | 11220000011222002122112 |
4 | 233220103303000001 |
5 | 1314214342102001 |
6 | 35254441345105 |
7 | 3460231023434 |
oct | 575023630001 |
9 | 156004862575 |
10 | 51142144001 |
11 | 1a764452813 |
12 | 9ab3498195 |
13 | 4a90588090 |
14 | 26922bd81b |
15 | 14e4ca2cbb |
hex | be84f3001 |
51142144001 has 4 divisors (see below), whose sum is σ = 55076155092. Its totient is φ = 47208132912.
The previous prime is 51142143973. The next prime is 51142144019. The reversal of 51142144001 is 10044124115.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7062721600 + 44079422401 = 84040^2 + 209951^2 .
It is a cyclic number.
It is not a de Polignac number, because 51142144001 - 26 = 51142143937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51142144301) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1967005526 + ... + 1967005551.
It is an arithmetic number, because the mean of its divisors is an integer number (13769038773).
Almost surely, 251142144001 is an apocalyptic number.
It is an amenable number.
51142144001 is a deficient number, since it is larger than the sum of its proper divisors (3934011091).
51142144001 is a wasteful number, since it uses less digits than its factorization.
51142144001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3934011090.
The product of its (nonzero) digits is 640, while the sum is 23.
Adding to 51142144001 its reverse (10044124115), we get a palindrome (61186268116).
The spelling of 51142144001 in words is "fifty-one billion, one hundred forty-two million, one hundred forty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •