Base | Representation |
---|---|
bin | 10111111111001… |
… | …01000001000101 |
3 | 112000121211120000 |
4 | 23333211001011 |
5 | 403002403234 |
6 | 31544431513 |
7 | 4662210525 |
oct | 1377450105 |
9 | 460554500 |
10 | 201216069 |
11 | a364367a |
12 | 57478599 |
13 | 328c1982 |
14 | 1ca1b685 |
15 | 129e9899 |
hex | bfe5045 |
201216069 has 20 divisors (see below), whose sum is σ = 307918380. Its totient is φ = 130870080.
The previous prime is 201216053. The next prime is 201216077. The reversal of 201216069 is 960612102.
It can be written as a sum of positive squares in 2 ways, for example, as 85932900 + 115283169 = 9270^2 + 10737^2 .
It is not a de Polignac number, because 201216069 - 24 = 201216053 is a prime.
It is a super-2 number, since 2×2012160692 = 80975812847625522, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201217069) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 26974 + ... + 33615.
It is an arithmetic number, because the mean of its divisors is an integer number (15395919).
Almost surely, 2201216069 is an apocalyptic number.
It is an amenable number.
201216069 is a deficient number, since it is larger than the sum of its proper divisors (106702311).
201216069 is an equidigital number, since it uses as much as digits as its factorization.
201216069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60642 (or 60633 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The square root of 201216069 is about 14185.0649980887. The cubic root of 201216069 is about 585.9864225519.
It can be divided in two parts, 2012 and 16069, that added together give a palindrome (18081).
The spelling of 201216069 in words is "two hundred one million, two hundred sixteen thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •