Base | Representation |
---|---|
bin | 1010110011010… |
… | …1111010000100 |
3 | 10011020222001022 |
4 | 2230311322010 |
5 | 43044401242 |
6 | 4255050312 |
7 | 1060060610 |
oct | 254657204 |
9 | 104228038 |
10 | 45309572 |
11 | 23637830 |
12 | 13210998 |
13 | 95054c9 |
14 | 6036340 |
15 | 3ea00d2 |
hex | 2b35e84 |
45309572 has 48 divisors (see below), whose sum is σ = 99593088. Its totient is φ = 17521920.
The previous prime is 45309557. The next prime is 45309577. The reversal of 45309572 is 27590354.
45309572 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (45309577) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 47888 + ... + 48824.
It is an arithmetic number, because the mean of its divisors is an integer number (2074856).
Almost surely, 245309572 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 45309572, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (49796544).
45309572 is an abundant number, since it is smaller than the sum of its proper divisors (54283516).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45309572 is a wasteful number, since it uses less digits than its factorization.
45309572 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1116 (or 1114 counting only the distinct ones).
The product of its (nonzero) digits is 37800, while the sum is 35.
The square root of 45309572 is about 6731.2385190246. The cubic root of 45309572 is about 356.5031076237.
The spelling of 45309572 in words is "forty-five million, three hundred nine thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •