Base | Representation |
---|---|
bin | 101101101101001110100011… |
… | …101110000101000001101111 |
3 | 222100202100000110212012000111 |
4 | 231231032203232011001233 |
5 | 202322003131341320421 |
6 | 1551311205400440451 |
7 | 60225136333626340 |
oct | 5555164356050157 |
9 | 870670013765014 |
10 | 201020101120111 |
11 | 590621675542a9 |
12 | 1a667061179127 |
13 | 8822163b78920 |
14 | 378d5d39560c7 |
15 | 1838eda397ee1 |
hex | b6d3a3b8506f |
201020101120111 has 32 divisors (see below), whose sum is σ = 248551770015360. Its totient is φ = 158314808461824.
The previous prime is 201020101120063. The next prime is 201020101120117. The reversal of 201020101120111 is 111021101020102.
It is a happy number.
It is not a de Polignac number, because 201020101120111 - 29 = 201020101119599 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 201020101120091 and 201020101120100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201020101120117) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 82425021 + ... + 84828793.
It is an arithmetic number, because the mean of its divisors is an integer number (7767242812980).
Almost surely, 2201020101120111 is an apocalyptic number.
201020101120111 is a deficient number, since it is larger than the sum of its proper divisors (47531668895249).
201020101120111 is a wasteful number, since it uses less digits than its factorization.
201020101120111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2408035.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 201020101120111 its reverse (111021101020102), we get a palindrome (312041202140213).
The spelling of 201020101120111 in words is "two hundred one trillion, twenty billion, one hundred one million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •