Base | Representation |
---|---|
bin | 110100110100010101… |
… | …100001011011001001 |
3 | 12102101101211012122012 |
4 | 310310111201123021 |
5 | 1412121413211014 |
6 | 42015312305305 |
7 | 4045251263315 |
oct | 646425413311 |
9 | 172341735565 |
10 | 56712632009 |
11 | 22062890910 |
12 | aba8b42235 |
13 | 546a67b727 |
14 | 2a60044b45 |
15 | 171dd47c3e |
hex | d345616c9 |
56712632009 has 48 divisors (see below), whose sum is σ = 67659459840. Its totient is φ = 47114077440.
The previous prime is 56712631957. The next prime is 56712632021. The reversal of 56712632009 is 90023621765.
It is not a de Polignac number, because 56712632009 - 28 = 56712631753 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (56712632209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 15565742 + ... + 15569384.
It is an arithmetic number, because the mean of its divisors is an integer number (1409572080).
Almost surely, 256712632009 is an apocalyptic number.
56712632009 is a gapful number since it is divisible by the number (59) formed by its first and last digit.
It is an amenable number.
56712632009 is a deficient number, since it is larger than the sum of its proper divisors (10946827831).
56712632009 is a wasteful number, since it uses less digits than its factorization.
56712632009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3830 (or 3813 counting only the distinct ones).
The product of its (nonzero) digits is 136080, while the sum is 41.
The spelling of 56712632009 in words is "fifty-six billion, seven hundred twelve million, six hundred thirty-two thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •