Base | Representation |
---|---|
bin | 110100101000010000… |
… | …111101110110101011 |
3 | 12101212021202002020112 |
4 | 310220100331312223 |
5 | 1411213042024042 |
6 | 41543235444535 |
7 | 4040242006430 |
oct | 645020756653 |
9 | 171767662215 |
10 | 56510111147 |
11 | 21a695369a6 |
12 | ab5115674b |
13 | 5437720bb9 |
14 | 2a411a7b87 |
15 | 170b191982 |
hex | d2843ddab |
56510111147 has 8 divisors (see below), whose sum is σ = 64608400896. Its totient is φ = 48418175592.
The previous prime is 56510111107. The next prime is 56510111153. The reversal of 56510111147 is 74111101565.
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 56510111147 - 234 = 39330241963 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (56510111107) 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 7 ways as a sum of consecutive naturals, for example, 1569473 + ... + 1605074.
It is an arithmetic number, because the mean of its divisors is an integer number (8076050112).
Almost surely, 256510111147 is an apocalyptic number.
56510111147 is a deficient number, since it is larger than the sum of its proper divisors (8098289749).
56510111147 is a wasteful number, since it uses less digits than its factorization.
56510111147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3177097.
The product of its (nonzero) digits is 4200, while the sum is 32.
The spelling of 56510111147 in words is "fifty-six billion, five hundred ten million, one hundred eleven thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •