Base | Representation |
---|---|
bin | 1011101101001100110… |
… | …1111011111001100101 |
3 | 201020002211222022201010 |
4 | 2323103031323321211 |
5 | 11243334202011123 |
6 | 232220055052433 |
7 | 20346513665541 |
oct | 2732315737145 |
9 | 636084868633 |
10 | 201112141413 |
11 | 78322619537 |
12 | 32b88071119 |
13 | 15c70861311 |
14 | 9a3baa0a21 |
15 | 5370e07993 |
hex | 2ed337be65 |
201112141413 has 4 divisors (see below), whose sum is σ = 268149521888. Its totient is φ = 134074760940.
The previous prime is 201112141379. The next prime is 201112141429. The reversal of 201112141413 is 314141211102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 201112141413 - 210 = 201112140389 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 201112141413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201112141313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33518690233 + ... + 33518690238.
It is an arithmetic number, because the mean of its divisors is an integer number (67037380472).
Almost surely, 2201112141413 is an apocalyptic number.
It is an amenable number.
201112141413 is a deficient number, since it is larger than the sum of its proper divisors (67037380475).
201112141413 is an equidigital number, since it uses as much as digits as its factorization.
201112141413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67037380474.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 201112141413 its reverse (314141211102), we get a palindrome (515253352515).
The spelling of 201112141413 in words is "two hundred one billion, one hundred twelve million, one hundred forty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •