Base | Representation |
---|---|
bin | 101101101111110111001110… |
… | …001000000100001110111101 |
3 | 222101101122110122121120001212 |
4 | 231233313032020010032331 |
5 | 202332440030001431414 |
6 | 1551530320020014205 |
7 | 60244210221133523 |
oct | 5557671610041675 |
9 | 871348418546055 |
10 | 201201201202109 |
11 | 59121a4a857359 |
12 | 1a696183231365 |
13 | 883626569c264 |
14 | 37982938b2313 |
15 | 183da8945183e |
hex | b6fdce2043bd |
201201201202109 has 4 divisors (see below), whose sum is σ = 201679113794460. Its totient is φ = 200723288609760.
The previous prime is 201201201202093. The next prime is 201201201202159. The reversal of 201201201202109 is 901202102102102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 51736443768025 + 149464757434084 = 7192805^2 + 12225578^2 .
It is a cyclic number.
It is not a de Polignac number, because 201201201202109 - 24 = 201201201202093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201201201202159) 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, 238956295544 + ... + 238956296385.
It is an arithmetic number, because the mean of its divisors is an integer number (50419778448615).
Almost surely, 2201201201202109 is an apocalyptic number.
It is an amenable number.
201201201202109 is a deficient number, since it is larger than the sum of its proper divisors (477912592351).
201201201202109 is an equidigital number, since it uses as much as digits as its factorization.
201201201202109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 477912592350.
The product of its (nonzero) digits is 288, while the sum is 23.
The spelling of 201201201202109 in words is "two hundred one trillion, two hundred one billion, two hundred one million, two hundred two thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.142 sec. • engine limits •