Base | Representation |
---|---|
bin | 1010101111100… |
… | …0010001011010 |
3 | 10010210010202000 |
4 | 2223320101122 |
5 | 43013311424 |
6 | 4245421430 |
7 | 1054656564 |
oct | 253702132 |
9 | 103703660 |
10 | 45057114 |
11 | 23485093 |
12 | 1310a876 |
13 | 944761b |
14 | 5dac334 |
15 | 3e503c9 |
hex | 2af845a |
45057114 has 64 divisors (see below), whose sum is σ = 104993280. Its totient is φ = 14307840.
The previous prime is 45057109. The next prime is 45057121. The reversal of 45057114 is 41175054.
It is a happy number.
45057114 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 103842 + ... + 104274.
It is an arithmetic number, because the mean of its divisors is an integer number (1640520).
Almost surely, 245057114 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 45057114, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (52496640).
45057114 is an abundant number, since it is smaller than the sum of its proper divisors (59936166).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45057114 is a wasteful number, since it uses less digits than its factorization.
45057114 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 532 (or 526 counting only the distinct ones).
The product of its (nonzero) digits is 2800, while the sum is 27.
The square root of 45057114 is about 6712.4596088170. The cubic root of 45057114 is about 355.8397471301.
The spelling of 45057114 in words is "forty-five million, fifty-seven thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •