Base | Representation |
---|---|
bin | 101101101100111100110001… |
… | …111011101010111000001001 |
3 | 222100200111202010201010210111 |
4 | 231230330301323222320021 |
5 | 202321200033111224314 |
6 | 1551254331255114321 |
7 | 60223562313603610 |
oct | 5554746173527011 |
9 | 870614663633714 |
10 | 201001012211209 |
11 | 59055061342531 |
12 | 1a6634143729a1 |
13 | 882041117ba62 |
14 | 378c702676877 |
15 | 183876e5e9ec4 |
hex | b6cf31eeae09 |
201001012211209 has 4 divisors (see below), whose sum is σ = 229715442527104. Its totient is φ = 172286581895316.
The previous prime is 201001012211191. The next prime is 201001012211249. The reversal of 201001012211209 is 902112210100102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 201001012211209 - 211 = 201001012209161 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 201001012211209.
It is not an unprimeable number, because it can be changed into a prime (201001012211249) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14357215157937 + ... + 14357215157950.
It is an arithmetic number, because the mean of its divisors is an integer number (57428860631776).
Almost surely, 2201001012211209 is an apocalyptic number.
It is an amenable number.
201001012211209 is a deficient number, since it is larger than the sum of its proper divisors (28714430315895).
201001012211209 is an equidigital number, since it uses as much as digits as its factorization.
201001012211209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28714430315894.
The product of its (nonzero) digits is 144, while the sum is 22.
The spelling of 201001012211209 in words is "two hundred one trillion, one billion, twelve million, two hundred eleven thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •