Base | Representation |
---|---|
bin | 1011101100111011111… |
… | …0111110100101110101 |
3 | 201012220220022121212101 |
4 | 2323032332332211311 |
5 | 11243213011031123 |
6 | 232205040422101 |
7 | 20344662152152 |
oct | 2731676764565 |
9 | 635826277771 |
10 | 201041111413 |
11 | 7829651465a |
12 | 32b68317931 |
13 | 15c5bc21a2c |
14 | 9a32491229 |
15 | 5369a76aad |
hex | 2ecefbe975 |
201041111413 has 8 divisors (see below), whose sum is σ = 211639216320. Its totient is φ = 190444705920.
The previous prime is 201041111407. The next prime is 201041111419. The reversal of 201041111413 is 314111140102.
It is an interprime number because it is at equal distance from previous prime (201041111407) and next prime (201041111419).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201041111413 - 29 = 201041110901 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201041111419) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 178345 + ... + 658702.
It is an arithmetic number, because the mean of its divisors is an integer number (26454902040).
Almost surely, 2201041111413 is an apocalyptic number.
It is an amenable number.
201041111413 is a deficient number, since it is larger than the sum of its proper divisors (10598104907).
201041111413 is a wasteful number, since it uses less digits than its factorization.
201041111413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 849707.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 201041111413 its reverse (314111140102), we get a palindrome (515152251515).
The spelling of 201041111413 in words is "two hundred one billion, forty-one million, one hundred eleven thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •