Base | Representation |
---|---|
bin | 101111101110111011… |
… | …000100110110110011 |
3 | 11220021220202110020000 |
4 | 233232323010312303 |
5 | 1314431243312201 |
6 | 35313443521043 |
7 | 3463046124222 |
oct | 575673046663 |
9 | 156256673200 |
10 | 51253104051 |
11 | 1a81104a736 |
12 | 9b24689183 |
13 | 4aaa568406 |
14 | 26a2d24cb9 |
15 | 14ee8bed86 |
hex | beeec4db3 |
51253104051 has 20 divisors (see below), whose sum is σ = 77532444000. Its totient is φ = 33736216176.
The previous prime is 51253104043. The next prime is 51253104137. The reversal of 51253104051 is 15040135215.
51253104051 is a `hidden beast` number, since 5 + 1 + 253 + 1 + 0 + 405 + 1 = 666.
It is not a de Polignac number, because 51253104051 - 23 = 51253104043 is a prime.
It is a super-2 number, since 2×512531040512 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (51253104011) 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 in 19 ways as a sum of consecutive naturals, for example, 3998376 + ... + 4011173.
It is an arithmetic number, because the mean of its divisors is an integer number (3876622200).
Almost surely, 251253104051 is an apocalyptic number.
51253104051 is a deficient number, since it is larger than the sum of its proper divisors (26279339949).
51253104051 is an equidigital number, since it uses as much as digits as its factorization.
51253104051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8009640 (or 8009631 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
Adding to 51253104051 its reverse (15040135215), we get a palindrome (66293239266).
The spelling of 51253104051 in words is "fifty-one billion, two hundred fifty-three million, one hundred four thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •