Base | Representation |
---|---|
bin | 1010110010101… |
… | …0111111011000 |
3 | 10011011200201011 |
4 | 2230222333120 |
5 | 43041433411 |
6 | 4254103304 |
7 | 1056513340 |
oct | 254527730 |
9 | 104150634 |
10 | 45264856 |
11 | 2360717a |
12 | 131aab34 |
13 | 94bb050 |
14 | 6023d20 |
15 | 3e91c21 |
hex | 2b2afd8 |
45264856 has 64 divisors (see below), whose sum is σ = 105698880. Its totient is φ = 17694720.
The previous prime is 45264841. The next prime is 45264871. The reversal of 45264856 is 65846254.
It is an interprime number because it is at equal distance from previous prime (45264841) and next prime (45264871).
It is a hoax number, since the sum of its digits (40) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is an upside-down number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 70296 + ... + 70936.
It is an arithmetic number, because the mean of its divisors is an integer number (1651545).
Almost surely, 245264856 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 45264856, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (52849440).
45264856 is an abundant number, since it is smaller than the sum of its proper divisors (60434024).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45264856 is a wasteful number, since it uses less digits than its factorization.
45264856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 764 (or 760 counting only the distinct ones).
The product of its digits is 230400, while the sum is 40.
The square root of 45264856 is about 6727.9161707025. The cubic root of 45264856 is about 356.3857914267.
The spelling of 45264856 in words is "forty-five million, two hundred sixty-four thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •