Base | Representation |
---|---|
bin | 101111101000111001… |
… | …110101000110000011 |
3 | 11220000212201121222122 |
4 | 233220321311012003 |
5 | 1314224420122201 |
6 | 35255435154455 |
7 | 3460411536563 |
oct | 575071650603 |
9 | 156025647878 |
10 | 51152114051 |
11 | 1a76a042425 |
12 | 9ab68a5a2b |
13 | 4a9266910c |
14 | 2693756da3 |
15 | 14e5ac1e1b |
hex | be8e75183 |
51152114051 has 8 divisors (see below), whose sum is σ = 53909771520. Its totient is φ = 48401000712.
The previous prime is 51152114047. The next prime is 51152114093. The reversal of 51152114051 is 15041125115.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 51152114051 - 22 = 51152114047 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 51152114051.
It is not an unprimeable number, because it can be changed into a prime (51152134051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1619975 + ... + 1651248.
It is an arithmetic number, because the mean of its divisors is an integer number (6738721440).
Almost surely, 251152114051 is an apocalyptic number.
51152114051 is a deficient number, since it is larger than the sum of its proper divisors (2757657469).
51152114051 is a wasteful number, since it uses less digits than its factorization.
51152114051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3272065.
The product of its (nonzero) digits is 1000, while the sum is 26.
Adding to 51152114051 its reverse (15041125115), we get a palindrome (66193239166).
The spelling of 51152114051 in words is "fifty-one billion, one hundred fifty-two million, one hundred fourteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •