Base | Representation |
---|---|
bin | 101111100101110011… |
… | …000100011000010001 |
3 | 11212220020200110200000 |
4 | 233211303010120101 |
5 | 1314123100310001 |
6 | 35250334320213 |
7 | 3456206626665 |
oct | 574563043021 |
9 | 155806613600 |
10 | 51100010001 |
11 | 1a742694927 |
12 | 9aa1359069 |
13 | 4a84925111 |
14 | 268a8728a5 |
15 | 14e122da86 |
hex | be5cc4611 |
51100010001 has 24 divisors (see below), whose sum is σ = 77593457760. Its totient is φ = 33599994912.
The previous prime is 51100009981. The next prime is 51100010011. The reversal of 51100010001 is 10001000115.
It is not a de Polignac number, because 51100010001 - 26 = 51100009937 is a prime.
It is a super-2 number, since 2×511000100012 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
51100010001 is a modest number, since divided by 10001 gives 511 as remainder.
It is not an unprimeable number, because it can be changed into a prime (51100010011) 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 23 ways as a sum of consecutive naturals, for example, 1422591 + ... + 1458068.
It is an arithmetic number, because the mean of its divisors is an integer number (3233060740).
Almost surely, 251100010001 is an apocalyptic number.
It is an amenable number.
51100010001 is a deficient number, since it is larger than the sum of its proper divisors (26493447759).
51100010001 is an equidigital number, since it uses as much as digits as its factorization.
51100010001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2880747 (or 2880735 counting only the distinct ones).
The product of its (nonzero) digits is 5, while the sum is 9.
Adding to 51100010001 its reverse (10001000115), we get a palindrome (61101010116).
The spelling of 51100010001 in words is "fifty-one billion, one hundred million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •