Base | Representation |
---|---|
bin | 1000010010000… |
… | …11000100010000 |
3 | 11211201222122000 |
4 | 10021003010100 |
5 | 120241340340 |
6 | 10521114000 |
7 | 1502401461 |
oct | 411030420 |
9 | 154658560 |
10 | 69480720 |
11 | 36246991 |
12 | 1b328900 |
13 | 1151936a |
14 | 9328d68 |
15 | 6176d30 |
hex | 4243110 |
69480720 has 160 divisors (see below), whose sum is σ = 252067200. Its totient is φ = 17542656.
The previous prime is 69480713. The next prime is 69480731. The reversal of 69480720 is 2708496.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 40194 + ... + 41886.
It is an arithmetic number, because the mean of its divisors is an integer number (1575420).
Almost surely, 269480720 is an apocalyptic number.
69480720 is a gapful number since it is divisible by the number (60) 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 69480720, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126033600).
69480720 is an abundant number, since it is smaller than the sum of its proper divisors (182586480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
69480720 is a wasteful number, since it uses less digits than its factorization.
69480720 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1734 (or 1722 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The square root of 69480720 is about 8335.5095825030. The cubic root of 69480720 is about 411.1069038338.
The spelling of 69480720 in words is "sixty-nine million, four hundred eighty thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •