Base | Representation |
---|---|
bin | 1011101101010001011… |
… | …0010011011100011111 |
3 | 201020011011200010202201 |
4 | 2323110112103130133 |
5 | 11243404031042343 |
6 | 232222013432331 |
7 | 20350134150166 |
oct | 2732426233437 |
9 | 636134603681 |
10 | 201131112223 |
11 | 783322a6598 |
12 | 32b9249b6a7 |
13 | 15c74774152 |
14 | 9a403dc3dd |
15 | 537290394d |
hex | 2ed459371f |
201131112223 has 4 divisors (see below), whose sum is σ = 201215517088. Its totient is φ = 201046707360.
The previous prime is 201131112191. The next prime is 201131112239. The reversal of 201131112223 is 322211131102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 201131112223 - 25 = 201131112191 is a prime.
It is a super-2 number, since 2×2011311122232 (a number of 23 digits) contains 22 as substring.
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 201131112223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201131112253) 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, 42198858 + ... + 42203623.
It is an arithmetic number, because the mean of its divisors is an integer number (50303879272).
Almost surely, 2201131112223 is an apocalyptic number.
201131112223 is a deficient number, since it is larger than the sum of its proper divisors (84404865).
201131112223 is an equidigital number, since it uses as much as digits as its factorization.
201131112223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84404864.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 201131112223 its reverse (322211131102), we get a palindrome (523342243325).
The spelling of 201131112223 in words is "two hundred one billion, one hundred thirty-one million, one hundred twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •