Base | Representation |
---|---|
bin | 101010101101110000… |
… | …000000000000000000 |
3 | 11101101101112220000000 |
4 | 222231300000000000 |
5 | 1222412331323430 |
6 | 33023040000000 |
7 | 3212366432022 |
oct | 525560000000 |
9 | 141341486000 |
10 | 45864714240 |
11 | 184a6487714 |
12 | 8a80000000 |
13 | 442c101987 |
14 | 2311442012 |
15 | 12d67e9e60 |
hex | aadc00000 |
45864714240 has 368 divisors, whose sum is σ = 165087785760. Its totient is φ = 12230590464.
The previous prime is 45864714199. The next prime is 45864714263. The reversal of 45864714240 is 4241746854.
It is a Jordan-Polya number, since it can be written as 6! ⋅ (4!)5 ⋅ (2!)3.
45864714240 is a `hidden beast` number, since 4 + 586 + 47 + 1 + 4 + 24 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9172942846 + ... + 9172942850.
Almost surely, 245864714240 is an apocalyptic number.
45864714240 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 45864714240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82543892880).
45864714240 is an abundant number, since it is smaller than the sum of its proper divisors (119223071520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45864714240 is an frugal number, since it uses more digits than its factorization.
45864714240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70 (or 10 counting only the distinct ones).
The product of its (nonzero) digits is 860160, while the sum is 45.
The spelling of 45864714240 in words is "forty-five billion, eight hundred sixty-four million, seven hundred fourteen thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •