Base | Representation |
---|---|
bin | 101111100101110100… |
… | …000110011100011001 |
3 | 11212220021012012212020 |
4 | 233211310012130121 |
5 | 1314123132434401 |
6 | 35250344205053 |
7 | 3456212134626 |
oct | 574564063431 |
9 | 155807165766 |
10 | 51100280601 |
11 | 1a74285a167 |
12 | 9aa1469789 |
13 | 4a849bb336 |
14 | 268a90334d |
15 | 14e1283d36 |
hex | be5d06719 |
51100280601 has 4 divisors (see below), whose sum is σ = 68133707472. Its totient is φ = 34066853732.
The previous prime is 51100280599. The next prime is 51100280633. The reversal of 51100280601 is 10608200115.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 51100280601 - 21 = 51100280599 is a prime.
It is a super-2 number, since 2×511002806012 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (51100280641) 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 3 ways as a sum of consecutive naturals, for example, 8516713431 + ... + 8516713436.
It is an arithmetic number, because the mean of its divisors is an integer number (17033426868).
Almost surely, 251100280601 is an apocalyptic number.
It is an amenable number.
51100280601 is a deficient number, since it is larger than the sum of its proper divisors (17033426871).
51100280601 is a wasteful number, since it uses less digits than its factorization.
51100280601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17033426870.
The product of its (nonzero) digits is 480, while the sum is 24.
Adding to 51100280601 its reverse (10608200115), we get a palindrome (61708480716).
The spelling of 51100280601 in words is "fifty-one billion, one hundred million, two hundred eighty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •