Base | Representation |
---|---|
bin | 1010111100001… |
… | …1101000010000 |
3 | 10012100110100000 |
4 | 2233003220100 |
5 | 43221440224 |
6 | 4315330000 |
7 | 1065026163 |
oct | 257035020 |
9 | 105313300 |
10 | 45890064 |
11 | 239a3980 |
12 | 13450900 |
13 | 96797ac |
14 | 6147ada |
15 | 40670c9 |
hex | 2bc3a10 |
45890064 has 240 divisors, whose sum is σ = 154365120. Its totient is φ = 13063680.
The previous prime is 45890059. The next prime is 45890107. The reversal of 45890064 is 46009854.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1240254 + ... + 1240290.
It is an arithmetic number, because the mean of its divisors is an integer number (643188).
Almost surely, 245890064 is an apocalyptic number.
45890064 is a gapful number since it is divisible by the number (44) 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 45890064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (77182560).
45890064 is an abundant number, since it is smaller than the sum of its proper divisors (108475056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45890064 is a wasteful number, since it uses less digits than its factorization.
45890064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100 (or 82 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The square root of 45890064 is about 6774.2205455683. The cubic root of 45890064 is about 358.0191203129.
The spelling of 45890064 in words is "forty-five million, eight hundred ninety thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •