Base | Representation |
---|---|
bin | 110000000111001011… |
… | …101001001000110111 |
3 | 11221100021120222220122 |
4 | 300013023221020313 |
5 | 1321244441201101 |
6 | 35422103122155 |
7 | 3506120414612 |
oct | 600713511067 |
9 | 157307528818 |
10 | 51660100151 |
11 | 1a9aa863950 |
12 | a018a4335b |
13 | 4b439891ca |
14 | 2700dcb179 |
15 | 15254b651b |
hex | c072e9237 |
51660100151 has 16 divisors (see below), whose sum is σ = 58302162720. Its totient is φ = 45360852480.
The previous prime is 51660100147. The next prime is 51660100231. The reversal of 51660100151 is 15100106615.
It is a cyclic number.
It is not a de Polignac number, because 51660100151 - 22 = 51660100147 is a prime.
It is a super-2 number, since 2×516601001512 (a number of 22 digits) contains 22 as substring.
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 51660100151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51660100651) 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, 407486 + ... + 519003.
It is an arithmetic number, because the mean of its divisors is an integer number (3643885170).
Almost surely, 251660100151 is an apocalyptic number.
51660100151 is a deficient number, since it is larger than the sum of its proper divisors (6642062569).
51660100151 is a wasteful number, since it uses less digits than its factorization.
51660100151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 926674.
The product of its (nonzero) digits is 900, while the sum is 26.
Adding to 51660100151 its reverse (15100106615), we get a palindrome (66760206766).
The spelling of 51660100151 in words is "fifty-one billion, six hundred sixty million, one hundred thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •