Base | Representation |
---|---|
bin | 110100110011001010… |
… | …010100111110110000 |
3 | 12102100000201202011200 |
4 | 310303022110332300 |
5 | 1412101341421430 |
6 | 42013330011200 |
7 | 4044621604515 |
oct | 646312247660 |
9 | 172300652150 |
10 | 56692920240 |
11 | 220527480a0 |
12 | aba2416b00 |
13 | 5466569568 |
14 | 2a5b59330c |
15 | 171c252460 |
hex | d33294fb0 |
56692920240 has 120 divisors (see below), whose sum is σ = 207702273168. Its totient is φ = 13743736320.
The previous prime is 56692920239. The next prime is 56692920241. The reversal of 56692920240 is 4202929665.
56692920240 is a `hidden beast` number, since 566 + 9 + 29 + 20 + 2 + 40 = 666.
56692920240 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (56692920239) and next prime (56692920241).
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is not an unprimeable number, because it can be changed into a prime (56692920241) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3571179 + ... + 3587018.
Almost surely, 256692920240 is an apocalyptic number.
It is an amenable number.
56692920240 is an abundant number, since it is smaller than the sum of its proper divisors (151009352928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56692920240 is a wasteful number, since it uses less digits than its factorization.
56692920240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7158227 (or 7158218 counting only the distinct ones).
The product of its (nonzero) digits is 466560, while the sum is 45.
The spelling of 56692920240 in words is "fifty-six billion, six hundred ninety-two million, nine hundred twenty thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •