Base | Representation |
---|---|
bin | 1011101100110100100… |
… | …0010011010100111001 |
3 | 201012211201210001200121 |
4 | 2323031020103110321 |
5 | 11243132030014314 |
6 | 232202005533241 |
7 | 20344133550643 |
oct | 2731510232471 |
9 | 635751701617 |
10 | 201010001209 |
11 | 7827a9a6046 |
12 | 32b59a14221 |
13 | 15c5564b624 |
14 | 9a2c2b3893 |
15 | 5366e7dd24 |
hex | 2ecd213539 |
201010001209 has 8 divisors (see below), whose sum is σ = 201120965280. Its totient is φ = 200899074816.
The previous prime is 201010001173. The next prime is 201010001281. The reversal of 201010001209 is 902100010102.
201010001209 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201010001209 - 27 = 201010001081 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201010001192 and 201010001201.
It is not an unprimeable number, because it can be changed into a prime (201010001609) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22422162 + ... + 22431124.
It is an arithmetic number, because the mean of its divisors is an integer number (25140120660).
Almost surely, 2201010001209 is an apocalyptic number.
It is an amenable number.
201010001209 is a deficient number, since it is larger than the sum of its proper divisors (110964071).
201010001209 is an equidigital number, since it uses as much as digits as its factorization.
201010001209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18839.
The product of its (nonzero) digits is 36, while the sum is 16.
The spelling of 201010001209 in words is "two hundred one billion, ten million, one thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •