Base | Representation |
---|---|
bin | 1000010011111… |
… | …11100110100000 |
3 | 11212012120202102 |
4 | 10021333212200 |
5 | 120322304142 |
6 | 10530305532 |
7 | 1504453406 |
oct | 411774640 |
9 | 155176672 |
10 | 69728672 |
11 | 363a6202 |
12 | 1b4282a8 |
13 | 115a5190 |
14 | 9391476 |
15 | 61c5532 |
hex | 427f9a0 |
69728672 has 48 divisors (see below), whose sum is σ = 152635392. Its totient is φ = 31138560.
The previous prime is 69728669. The next prime is 69728677. The reversal of 69728672 is 27682796.
It is not an unprimeable number, because it can be changed into a prime (69728677) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10193 + ... + 15599.
It is an arithmetic number, because the mean of its divisors is an integer number (3179904).
Almost surely, 269728672 is an apocalyptic number.
69728672 is a gapful number since it is divisible by the number (62) 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 69728672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (76317696).
69728672 is an abundant number, since it is smaller than the sum of its proper divisors (82906720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
69728672 is a wasteful number, since it uses less digits than its factorization.
69728672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5461 (or 5453 counting only the distinct ones).
The product of its digits is 508032, while the sum is 47.
The square root of 69728672 is about 8350.3695726596. The cubic root of 69728672 is about 411.5953547427.
The spelling of 69728672 in words is "sixty-nine million, seven hundred twenty-eight thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •