Base | Representation |
---|---|
bin | 101101101101000111000111… |
… | …100010011110000011110101 |
3 | 222100201120101201011001000022 |
4 | 231231013013202132003311 |
5 | 202321340301200401401 |
6 | 1551303404532454525 |
7 | 60224434345361060 |
oct | 5555070742360365 |
9 | 870646351131008 |
10 | 201012112122101 |
11 | 59059837a10905 |
12 | 1a6655b177a445 |
13 | 882148c9b8477 |
14 | 378d0769138d7 |
15 | 1838bbdd2271b |
hex | b6d1c789e0f5 |
201012112122101 has 16 divisors (see below), whose sum is σ = 240204528304128. Its totient is φ = 164469309774000.
The previous prime is 201012112122079. The next prime is 201012112122113. The reversal of 201012112122101 is 101221211210102.
It is not a de Polignac number, because 201012112122101 - 218 = 201012111859957 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 201012112122101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201012112122161) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1271328725 + ... + 1271486826.
It is an arithmetic number, because the mean of its divisors is an integer number (15012783019008).
Almost surely, 2201012112122101 is an apocalyptic number.
It is an amenable number.
201012112122101 is a deficient number, since it is larger than the sum of its proper divisors (39192416182027).
201012112122101 is a wasteful number, since it uses less digits than its factorization.
201012112122101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2542816072.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 201012112122101 its reverse (101221211210102), we get a palindrome (302233323332203).
The spelling of 201012112122101 in words is "two hundred one trillion, twelve billion, one hundred twelve million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •