Base | Representation |
---|---|
bin | 1000100001001000… |
… | …11001110000000000 |
3 | 102210200210200210110 |
4 | 10100210121300000 |
5 | 33331133223113 |
6 | 2033434031320 |
7 | 221215252233 |
oct | 42044316000 |
9 | 12720720713 |
10 | 4572945408 |
11 | 1a37343629 |
12 | a77578540 |
13 | 57b536b75 |
14 | 31549741a |
15 | 1bb6ebbc3 |
hex | 110919c00 |
4572945408 has 132 divisors (see below), whose sum is σ = 12602560200. Its totient is φ = 1474191360.
The previous prime is 4572945407. The next prime is 4572945449. The reversal of 4572945408 is 8045492754.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4572945407) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2951418 + ... + 2952966.
Almost surely, 24572945408 is an apocalyptic number.
4572945408 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4572945408, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6301280100).
4572945408 is an abundant number, since it is smaller than the sum of its proper divisors (8029614792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4572945408 is a wasteful number, since it uses less digits than its factorization.
4572945408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1634 (or 1585 counting only the distinct ones).
The product of its (nonzero) digits is 1612800, while the sum is 48.
The square root of 4572945408 is about 67623.5566056681. The cubic root of 4572945408 is about 1659.8366084887.
The spelling of 4572945408 in words is "four billion, five hundred seventy-two million, nine hundred forty-five thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •