Base | Representation |
---|---|
bin | 101111101000011010… |
… | …111000001000010101 |
3 | 11220000022110101122000 |
4 | 233220122320020111 |
5 | 1314220331000041 |
6 | 35254545225513 |
7 | 3460252553532 |
oct | 575032701025 |
9 | 156008411560 |
10 | 51144000021 |
11 | 1a765500214 |
12 | 9ab4032299 |
13 | 4a90a87b0a |
14 | 2692643d89 |
15 | 14e501cbb6 |
hex | be86b8215 |
51144000021 has 16 divisors (see below), whose sum is σ = 75941500800. Its totient is φ = 34018324704.
The previous prime is 51143999957. The next prime is 51144000041. The reversal of 51144000021 is 12000044115.
It is not a de Polignac number, because 51144000021 - 26 = 51143999957 is a prime.
It is a super-3 number, since 3×511440000213 (a number of 33 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51143999958 and 51144000003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51144000041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2145576 + ... + 2169281.
It is an arithmetic number, because the mean of its divisors is an integer number (4746343800).
Almost surely, 251144000021 is an apocalyptic number.
It is an amenable number.
51144000021 is a deficient number, since it is larger than the sum of its proper divisors (24797500779).
51144000021 is a wasteful number, since it uses less digits than its factorization.
51144000021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4315305 (or 4315299 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
Adding to 51144000021 its reverse (12000044115), we get a palindrome (63144044136).
The spelling of 51144000021 in words is "fifty-one billion, one hundred forty-four million, twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •