Base | Representation |
---|---|
bin | 1011101101100100101… |
… | …0111010101011110101 |
3 | 201020100210220100011221 |
4 | 2323121022322223311 |
5 | 11244040233411201 |
6 | 232234023430341 |
7 | 20352135615325 |
oct | 2733112725365 |
9 | 636323810157 |
10 | 201212013301 |
11 | 78373a32792 |
12 | 32bb55b53b1 |
13 | 15c8845b700 |
14 | 9a4b05b285 |
15 | 5379a844a1 |
hex | 2ed92baaf5 |
201212013301 has 6 divisors (see below), whose sum is σ = 217880464290. Its totient is φ = 185734165968.
The previous prime is 201212013241. The next prime is 201212013307. The reversal of 201212013301 is 103310212102.
It can be written as a sum of positive squares in 3 ways, for example, as 4737018276 + 196474995025 = 68826^2 + 443255^2 .
It is a de Polignac number, because none of the positive numbers 2k-201212013301 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 (201212013307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 595301646 + ... + 595301983.
It is an arithmetic number, because the mean of its divisors is an integer number (36313410715).
Almost surely, 2201212013301 is an apocalyptic number.
It is an amenable number.
201212013301 is a deficient number, since it is larger than the sum of its proper divisors (16668450989).
201212013301 is a wasteful number, since it uses less digits than its factorization.
201212013301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1190603655 (or 1190603642 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 201212013301 its reverse (103310212102), we get a palindrome (304522225403).
The spelling of 201212013301 in words is "two hundred one billion, two hundred twelve million, thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •