Base | Representation |
---|---|
bin | 1000010000010… |
… | …01110010000000 |
3 | 11211022001202122 |
4 | 10020021302000 |
5 | 120211333310 |
6 | 10512103412 |
7 | 1500403421 |
oct | 410116200 |
9 | 154261678 |
10 | 69246080 |
11 | 360a6672 |
12 | 1b234b68 |
13 | 11466617 |
14 | 92a7648 |
15 | 612c555 |
hex | 4209c80 |
69246080 has 64 divisors (see below), whose sum is σ = 166580280. Its totient is φ = 27525120.
The previous prime is 69246071. The next prime is 69246097. The reversal of 69246080 is 8064296.
It can be written as a sum of positive squares in 4 ways, for example, as 53816896 + 15429184 = 7336^2 + 3928^2 .
It is a tau number, because it is divible by the number of its divisors (64).
It is a self number, because there is not a number n which added to its sum of digits gives 69246080.
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 7 ways as a sum of consecutive naturals, for example, 164270 + ... + 164690.
Almost surely, 269246080 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 69246080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (83290140).
69246080 is an abundant number, since it is smaller than the sum of its proper divisors (97334200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
69246080 is a wasteful number, since it uses less digits than its factorization.
69246080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 697 (or 685 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 35.
The square root of 69246080 is about 8321.4229552403. The cubic root of 69246080 is about 410.6436054590.
The spelling of 69246080 in words is "sixty-nine million, two hundred forty-six thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •