Base | Representation |
---|---|
bin | 1101010111111… |
… | …1110011011011 |
3 | 10220120002000010 |
4 | 3111333303123 |
5 | 103330114021 |
6 | 5322213003 |
7 | 1250553024 |
oct | 325776333 |
9 | 126502003 |
10 | 56098011 |
11 | 297362a2 |
12 | 16954163 |
13 | b811bb8 |
14 | 7643c4b |
15 | 4dd1976 |
hex | 357fcdb |
56098011 has 8 divisors (see below), whose sum is σ = 79197264. Its totient is φ = 35198720.
The previous prime is 56098001. The next prime is 56098027. The reversal of 56098011 is 11089065.
It is a happy number.
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 56098011 - 219 = 55573723 is a prime.
It is a super-2 number, since 2×560980112 = 6293973676312242, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 56098011.
It is not an unprimeable number, because it can be changed into a prime (56098001) 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, 549930 + ... + 550031.
It is an arithmetic number, because the mean of its divisors is an integer number (9899658).
Almost surely, 256098011 is an apocalyptic number.
56098011 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
56098011 is a deficient number, since it is larger than the sum of its proper divisors (23099253).
56098011 is a wasteful number, since it uses less digits than its factorization.
56098011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1099981.
The product of its (nonzero) digits is 2160, while the sum is 30.
The square root of 56098011 is about 7489.8605460983. The cubic root of 56098011 is about 382.8093068211.
The spelling of 56098011 in words is "fifty-six million, ninety-eight thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.018 sec. • engine limits •