Base | Representation |
---|---|
bin | 1011101101001101000… |
… | …1110000100001101011 |
3 | 201020002220212020011212 |
4 | 2323103101300201223 |
5 | 11243334431042103 |
6 | 232220132343335 |
7 | 20346525341024 |
oct | 2732321604153 |
9 | 636086766155 |
10 | 201113143403 |
11 | 78323143327 |
12 | 32b88474b4b |
13 | 15c70b22403 |
14 | 9a3bc81c4b |
15 | 53710547d8 |
hex | 2ed347086b |
201113143403 has 8 divisors (see below), whose sum is σ = 203802764928. Its totient is φ = 198439484544.
The previous prime is 201113143381. The next prime is 201113143417. The reversal of 201113143403 is 304341311102.
201113143403 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 201113143403 - 210 = 201113142379 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201113143423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3965300 + ... + 4015697.
It is an arithmetic number, because the mean of its divisors is an integer number (25475345616).
Almost surely, 2201113143403 is an apocalyptic number.
201113143403 is a deficient number, since it is larger than the sum of its proper divisors (2689621525).
201113143403 is a wasteful number, since it uses less digits than its factorization.
201113143403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7981333.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 201113143403 its reverse (304341311102), we get a palindrome (505454454505).
The spelling of 201113143403 in words is "two hundred one billion, one hundred thirteen million, one hundred forty-three thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •