Base | Representation |
---|---|
bin | 10111111101100… |
… | …11000000001001 |
3 | 112000020102112121 |
4 | 23332303000021 |
5 | 402424324314 |
6 | 31540211241 |
7 | 4660365340 |
oct | 1376630011 |
9 | 460212477 |
10 | 201011209 |
11 | a3513773 |
12 | 57399b21 |
13 | 3284c659 |
14 | 1c9a6b57 |
15 | 129a8d24 |
hex | bfb3009 |
201011209 has 16 divisors (see below), whose sum is σ = 238158720. Its totient is φ = 165997440.
The previous prime is 201011207. The next prime is 201011219. The reversal of 201011209 is 902110102.
201011209 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 201011209 - 21 = 201011207 is a prime.
It is a super-2 number, since 2×2010112092 = 80811012287283362, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201011192 and 201011201.
It is not an unprimeable number, because it can be changed into a prime (201011207) 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, 139557 + ... + 140989.
It is an arithmetic number, because the mean of its divisors is an integer number (14884920).
Almost surely, 2201011209 is an apocalyptic number.
201011209 is a gapful number since it is divisible by the number (29) formed by its first and last digit.
It is an amenable number.
201011209 is a deficient number, since it is larger than the sum of its proper divisors (37147511).
201011209 is a wasteful number, since it uses less digits than its factorization.
201011209 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2160.
The product of its (nonzero) digits is 36, while the sum is 16.
The square root of 201011209 is about 14177.8421841971. The cubic root of 201011209 is about 585.7874889017.
The spelling of 201011209 in words is "two hundred one million, eleven thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •