Base | Representation |
---|---|
bin | 101111100011001011… |
… | …011001011011110111 |
3 | 11212210011222101012002 |
4 | 233203023121123313 |
5 | 1314030322243210 |
6 | 35242124245515 |
7 | 3455134213244 |
oct | 574313313367 |
9 | 155704871162 |
10 | 51056056055 |
11 | 1a71a8a3654 |
12 | 9a8a6a089b |
13 | 4a787a5974 |
14 | 2684ab05cb |
15 | 14dc44a4a5 |
hex | be32d96f7 |
51056056055 has 64 divisors (see below), whose sum is σ = 70052843520. Its totient is φ = 35483443200.
The previous prime is 51056056033. The next prime is 51056056057. The reversal of 51056056055 is 55065065015.
It is not a de Polignac number, because 51056056055 - 26 = 51056055991 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51056056057) 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 63 ways as a sum of consecutive naturals, for example, 18291710 + ... + 18294500.
It is an arithmetic number, because the mean of its divisors is an integer number (1094575680).
Almost surely, 251056056055 is an apocalyptic number.
51056056055 is a deficient number, since it is larger than the sum of its proper divisors (18996787465).
51056056055 is a wasteful number, since it uses less digits than its factorization.
51056056055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3120.
The product of its (nonzero) digits is 112500, while the sum is 38.
The spelling of 51056056055 in words is "fifty-one billion, fifty-six million, fifty-six thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •