Base | Representation |
---|---|
bin | 1000001111111… |
… | …10110011101111 |
3 | 11211012210010000 |
4 | 10013332303233 |
5 | 120203414020 |
6 | 10511115343 |
7 | 1500125403 |
oct | 407766357 |
9 | 154183100 |
10 | 69201135 |
11 | 36075923 |
12 | 1b212b53 |
13 | 1144c023 |
14 | 9295103 |
15 | 611e090 |
hex | 41fecef |
69201135 has 120 divisors (see below), whose sum is σ = 144532080. Its totient is φ = 31477248.
The previous prime is 69201133. The next prime is 69201217. The reversal of 69201135 is 53110296.
It is not a de Polignac number, because 69201135 - 21 = 69201133 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 69201099 and 69201108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (69201131) by changing a digit.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 3008734 + ... + 3008756.
It is an arithmetic number, because the mean of its divisors is an integer number (1204434).
Almost surely, 269201135 is an apocalyptic number.
69201135 is an abundant number, since it is smaller than the sum of its proper divisors (75330945).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
69201135 is a wasteful number, since it uses less digits than its factorization.
69201135 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99 (or 67 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 27.
The square root of 69201135 is about 8318.7219571278. The cubic root of 69201135 is about 410.5547418420.
The spelling of 69201135 in words is "sixty-nine million, two hundred one thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •