Base | Representation |
---|---|
bin | 1000010101011… |
… | …00110101001000 |
3 | 11212112222212202 |
4 | 10022230311020 |
5 | 120344221203 |
6 | 10534255332 |
7 | 1506154460 |
oct | 412546510 |
9 | 155488782 |
10 | 69913928 |
11 | 36512407 |
12 | 1b4b7548 |
13 | 1163b5b6 |
14 | 93dcba0 |
15 | 6210388 |
hex | 42acd48 |
69913928 has 128 divisors (see below), whose sum is σ = 172523520. Its totient is φ = 25850880.
The previous prime is 69913927. The next prime is 69913931. The reversal of 69913928 is 82931996.
It is not an unprimeable number, because it can be changed into a prime (69913927) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 678725 + ... + 678827.
It is an arithmetic number, because the mean of its divisors is an integer number (1347840).
Almost surely, 269913928 is an apocalyptic number.
69913928 is a gapful number since it is divisible by the number (68) 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 69913928, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (86261760).
69913928 is an abundant number, since it is smaller than the sum of its proper divisors (102609592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
69913928 is a wasteful number, since it uses less digits than its factorization.
69913928 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187 (or 183 counting only the distinct ones).
The product of its digits is 209952, while the sum is 47.
The square root of 69913928 is about 8361.4548973250. The cubic root of 69913928 is about 411.9595429529.
The spelling of 69913928 in words is "sixty-nine million, nine hundred thirteen thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •