Base | Representation |
---|---|
bin | 101101101100111100000010… |
… | …001111100010001010000101 |
3 | 222100200102200101011220000122 |
4 | 231230330002033202022011 |
5 | 202321141413300041010 |
6 | 1551254120034151325 |
7 | 60223533430065065 |
oct | 5554740217421205 |
9 | 870612611156018 |
10 | 201000212112005 |
11 | 59054790744119 |
12 | 1a663230422545 |
13 | 8820314492987 |
14 | 378c6682c33a5 |
15 | 1838724253855 |
hex | b6cf023e2285 |
201000212112005 has 8 divisors (see below), whose sum is σ = 241200383782392. Its totient is φ = 160800083524288.
The previous prime is 201000212111911. The next prime is 201000212112013. The reversal of 201000212112005 is 500211212000102.
It can be written as a sum of positive squares in 4 ways, for example, as 15078015173764 + 185922196938241 = 3883042^2 + 13635329^2 .
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 201000212112005 - 210 = 201000212110981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 580967 + ... + 20058363.
It is an arithmetic number, because the mean of its divisors is an integer number (30150047972799).
Almost surely, 2201000212112005 is an apocalyptic number.
It is an amenable number.
201000212112005 is a deficient number, since it is larger than the sum of its proper divisors (40200171670387).
201000212112005 is a wasteful number, since it uses less digits than its factorization.
201000212112005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21541335.
The product of its (nonzero) digits is 80, while the sum is 17.
Adding to 201000212112005 its reverse (500211212000102), we get a palindrome (701211424112107).
The spelling of 201000212112005 in words is "two hundred one trillion, two hundred twelve million, one hundred twelve thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •