Base | Representation |
---|---|
bin | 1000001111010… |
… | …01111111100000 |
3 | 11211001110011010 |
4 | 10013221333200 |
5 | 120143201442 |
6 | 10505220520 |
7 | 1466322000 |
oct | 407517740 |
9 | 154043133 |
10 | 69115872 |
11 | 36017861 |
12 | 1b191740 |
13 | 1141c287 |
14 | 9272000 |
15 | 6103b9c |
hex | 41e9fe0 |
69115872 has 96 divisors (see below), whose sum is σ = 211680000. Its totient is φ = 19737984.
The previous prime is 69115859. The next prime is 69115877. The reversal of 69115872 is 27851196.
It is a tau number, because it is divible by the number of its divisors (96).
It is a self number, because there is not a number n which added to its sum of digits gives 69115872.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (69115877) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31879 + ... + 33977.
It is an arithmetic number, because the mean of its divisors is an integer number (2205000).
Almost surely, 269115872 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 69115872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (105840000).
69115872 is an abundant number, since it is smaller than the sum of its proper divisors (142564128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
69115872 is a wasteful number, since it uses less digits than its factorization.
69115872 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2133 (or 2111 counting only the distinct ones).
The product of its digits is 30240, while the sum is 39.
The square root of 69115872 is about 8313.5956120081. The cubic root of 69115872 is about 410.3860571547.
The spelling of 69115872 in words is "sixty-nine million, one hundred fifteen thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •