Base | Representation |
---|---|
bin | 101111100101110011… |
… | …011010010110110111 |
3 | 11212220020212001011011 |
4 | 233211303122112313 |
5 | 1314123111200043 |
6 | 35250340253051 |
7 | 3456210453310 |
oct | 574563322667 |
9 | 155806761134 |
10 | 51100100023 |
11 | 1a742746525 |
12 | 9aa13a1187 |
13 | 4a8495709b |
14 | 268a897607 |
15 | 14e124a59d |
hex | be5cda5b7 |
51100100023 has 8 divisors (see below), whose sum is σ = 59824507680. Its totient is φ = 42731790720.
The previous prime is 51100099987. The next prime is 51100100039. The reversal of 51100100023 is 32000100115.
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 51100100023 - 217 = 51099968951 is a prime.
It is a super-2 number, since 2×511001000232 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51100099976 and 51100100012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51100109023) 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 7 ways as a sum of consecutive naturals, for example, 89024278 + ... + 89024851.
It is an arithmetic number, because the mean of its divisors is an integer number (7478063460).
Almost surely, 251100100023 is an apocalyptic number.
51100100023 is a deficient number, since it is larger than the sum of its proper divisors (8724407657).
51100100023 is a wasteful number, since it uses less digits than its factorization.
51100100023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178049177.
The product of its (nonzero) digits is 30, while the sum is 13.
Adding to 51100100023 its reverse (32000100115), we get a palindrome (83100200138).
The spelling of 51100100023 in words is "fifty-one billion, one hundred million, one hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •