Base | Representation |
---|---|
bin | 110100001010110000… |
… | …110101111111011000 |
3 | 12100120210101111122121 |
4 | 310022300311333120 |
5 | 1404204334313224 |
6 | 41422155031024 |
7 | 4022051633215 |
oct | 641260657730 |
9 | 170523344577 |
10 | 56015151064 |
11 | 21835102084 |
12 | aa3343b474 |
13 | 5389011b02 |
14 | 29d5564b0c |
15 | 16cc9c1be4 |
hex | d0ac35fd8 |
56015151064 has 16 divisors (see below), whose sum is σ = 105031179000. Its totient is φ = 28006836672.
The previous prime is 56015151061. The next prime is 56015151089. The reversal of 56015151064 is 46015151065.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56015151061) 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 3 ways as a sum of consecutive naturals, for example, 360412 + ... + 491860.
Almost surely, 256015151064 is an apocalyptic number.
It is an amenable number.
56015151064 is a deficient number, since it is larger than the sum of its proper divisors (49016027936).
56015151064 is a wasteful number, since it uses less digits than its factorization.
56015151064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184722 (or 184718 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 34.
Subtracting from 56015151064 its reverse (46015151065), we obtain a palindrome (9999999999).
The spelling of 56015151064 in words is "fifty-six billion, fifteen million, one hundred fifty-one thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •