Base | Representation |
---|---|
bin | 101101101101000111001101… |
… | …100000010001111111111011 |
3 | 222100201120122200111010010202 |
4 | 231231013031200101333323 |
5 | 202321341002311233312 |
6 | 1551303422510032415 |
7 | 60224440002205361 |
oct | 5555071540217773 |
9 | 870646580433122 |
10 | 201012212211707 |
11 | 59059889463696 |
12 | 1a66561b1a870b |
13 | 88214a76609a0 |
14 | 378d085d29631 |
15 | 1838bc79e39c2 |
hex | b6d1cd811ffb |
201012212211707 has 36 divisors (see below), whose sum is σ = 227824978205664. Its totient is φ = 176291063952960.
The previous prime is 201012212211677. The next prime is 201012212211709. The reversal of 201012212211707 is 707112212210102.
It is not a de Polignac number, because 201012212211707 - 28 = 201012212211451 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 201012212211707.
It is not an unprimeable number, because it can be changed into a prime (201012212211709) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 152017982 + ... + 153334572.
It is an arithmetic number, because the mean of its divisors is an integer number (6328471616824).
Almost surely, 2201012212211707 is an apocalyptic number.
201012212211707 is a deficient number, since it is larger than the sum of its proper divisors (26812765993957).
201012212211707 is a wasteful number, since it uses less digits than its factorization.
201012212211707 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1316948 (or 1316776 counting only the distinct ones).
The product of its (nonzero) digits is 1568, while the sum is 29.
Adding to 201012212211707 its reverse (707112212210102), we get a palindrome (908124424421809).
The spelling of 201012212211707 in words is "two hundred one trillion, twelve billion, two hundred twelve million, two hundred eleven thousand, seven hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •