Base | Representation |
---|---|
bin | 1010110000111… |
… | …1000111000000 |
3 | 10010221220001112 |
4 | 2230033013000 |
5 | 43024310111 |
6 | 4251422452 |
7 | 1055526365 |
oct | 254170700 |
9 | 103856045 |
10 | 45150656 |
11 | 235393a1 |
12 | 13154a28 |
13 | 947b085 |
14 | 5dd446c |
15 | 3e6ce8b |
hex | 2b0f1c0 |
45150656 has 56 divisors (see below), whose sum is σ = 96133920. Its totient is φ = 20984832.
The previous prime is 45150653. The next prime is 45150667. The reversal of 45150656 is 65605154.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45150653) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 54050 + ... + 54878.
Almost surely, 245150656 is an apocalyptic number.
45150656 is a gapful number since it is divisible by the number (46) 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 45150656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (48066960).
45150656 is an abundant number, since it is smaller than the sum of its proper divisors (50983264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45150656 is a wasteful number, since it uses less digits than its factorization.
45150656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 901 (or 891 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 32.
The square root of 45150656 is about 6719.4237848196. The cubic root of 45150656 is about 356.0858270530.
The spelling of 45150656 in words is "forty-five million, one hundred fifty thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •