Base | Representation |
---|---|
bin | 101101101110100010011110… |
… | …101011111111101010110101 |
3 | 222101001221121101111102101212 |
4 | 231232202132223333222311 |
5 | 202324442203004013023 |
6 | 1551420431104131205 |
7 | 60234506336160356 |
oct | 5556423653775265 |
9 | 871057541442355 |
10 | 201110211001013 |
11 | 590973a81a5556 |
12 | 1a68060a906b05 |
13 | 882a7c4690c92 |
14 | 3793b01297d2d |
15 | 183b5111cbe78 |
hex | b6e89eaffab5 |
201110211001013 has 16 divisors (see below), whose sum is σ = 209225271091200. Its totient is φ = 193098674366640.
The previous prime is 201110211001003. The next prime is 201110211001033. The reversal of 201110211001013 is 310100112011102.
It is a cyclic number.
It is not a de Polignac number, because 201110211001013 - 24 = 201110211000997 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 (201110211001003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8250881 + ... + 21686342.
It is an arithmetic number, because the mean of its divisors is an integer number (13076579443200).
Almost surely, 2201110211001013 is an apocalyptic number.
It is an amenable number.
201110211001013 is a deficient number, since it is larger than the sum of its proper divisors (8115060090187).
201110211001013 is a wasteful number, since it uses less digits than its factorization.
201110211001013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29938952.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 201110211001013 its reverse (310100112011102), we get a palindrome (511210323012115).
The spelling of 201110211001013 in words is "two hundred one trillion, one hundred ten billion, two hundred eleven million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •