Base | Representation |
---|---|
bin | 101111100101110101… |
… | …010100101010110101 |
3 | 11212220021210111101100 |
4 | 233211311110222311 |
5 | 1314123223213023 |
6 | 35250355120313 |
7 | 3456214641030 |
oct | 574565245265 |
9 | 155807714340 |
10 | 51100601013 |
11 | 1a742a58970 |
12 | 9aa15a3099 |
13 | 4a84aa1127 |
14 | 268a988017 |
15 | 14e12e8c43 |
hex | be5d54ab5 |
51100601013 has 48 divisors (see below), whose sum is σ = 92282112000. Its totient is φ = 26471694240.
The previous prime is 51100601011. The next prime is 51100601021. The reversal of 51100601013 is 31010600115.
51100601013 is a `hidden beast` number, since 51 + 1 + 0 + 0 + 601 + 0 + 13 = 666.
It is not a de Polignac number, because 51100601013 - 21 = 51100601011 is a prime.
It is a super-2 number, since 2×511006010132 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51100601011) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 146088 + ... + 351486.
It is an arithmetic number, because the mean of its divisors is an integer number (1922544000).
Almost surely, 251100601013 is an apocalyptic number.
It is an amenable number.
51100601013 is a deficient number, since it is larger than the sum of its proper divisors (41181510987).
51100601013 is a wasteful number, since it uses less digits than its factorization.
51100601013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205782 (or 205779 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 18.
The spelling of 51100601013 in words is "fifty-one billion, one hundred million, six hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •