Base | Representation |
---|---|
bin | 101111111101101101… |
… | …111010100000101011 |
3 | 11220221012210201120121 |
4 | 233331231322200223 |
5 | 1320433313441133 |
6 | 35354231504111 |
7 | 3502151633536 |
oct | 577555724053 |
9 | 156835721517 |
10 | 51501312043 |
11 | 1a92916a005 |
12 | 9b93828037 |
13 | 4b19b0124c |
14 | 26c7c95a1d |
15 | 151659d02d |
hex | bfdb7a82b |
51501312043 has 4 divisors (see below), whose sum is σ = 51501861808. Its totient is φ = 51500762280.
The previous prime is 51501312041. The next prime is 51501312047. The reversal of 51501312043 is 34021310515.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 51501312043 - 21 = 51501312041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51501311999 and 51501312017.
It is not an unprimeable number, because it can be changed into a prime (51501312041) 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 3 ways as a sum of consecutive naturals, for example, 95223 + ... + 334768.
It is an arithmetic number, because the mean of its divisors is an integer number (12875465452).
Almost surely, 251501312043 is an apocalyptic number.
51501312043 is a deficient number, since it is larger than the sum of its proper divisors (549765).
51501312043 is a wasteful number, since it uses less digits than its factorization.
51501312043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 549764.
The product of its (nonzero) digits is 1800, while the sum is 25.
Adding to 51501312043 its reverse (34021310515), we get a palindrome (85522622558).
The spelling of 51501312043 in words is "fifty-one billion, five hundred one million, three hundred twelve thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •