Base | Representation |
---|---|
bin | 1010111001100… |
… | …0011110000000 |
3 | 10012000110211110 |
4 | 2232120132000 |
5 | 43200311110 |
6 | 4311443320 |
7 | 1063361604 |
oct | 256303600 |
9 | 105013743 |
10 | 45713280 |
11 | 23893078 |
12 | 13386540 |
13 | 96171a2 |
14 | 60dd504 |
15 | 402ea20 |
hex | 2b98780 |
45713280 has 128 divisors (see below), whose sum is σ = 150919200. Its totient is φ = 11755520.
The previous prime is 45713267. The next prime is 45713321. The reversal of 45713280 is 8231754.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (30).
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 15 ways as a sum of consecutive naturals, for example, 55270 + ... + 56090.
Almost surely, 245713280 is an apocalyptic number.
45713280 is a gapful number since it is divisible by the number (40) 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 45713280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75459600).
45713280 is an abundant number, since it is smaller than the sum of its proper divisors (105205920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45713280 is a wasteful number, since it uses less digits than its factorization.
45713280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 872 (or 860 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 30.
The square root of 45713280 is about 6761.1596638447. The cubic root of 45713280 is about 357.5587919024.
The spelling of 45713280 in words is "forty-five million, seven hundred thirteen thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •