Base | Representation |
---|---|
bin | 1011101101101001101… |
… | …1010111000110101111 |
3 | 201020102021120201101101 |
4 | 2323122123113012233 |
5 | 11244111133214411 |
6 | 232240055423531 |
7 | 20352513065221 |
oct | 2733233270657 |
9 | 636367521341 |
10 | 201233101231 |
11 | 78384926428 |
12 | 33000684ba7 |
13 | 15c8c933086 |
14 | 9a4db8a411 |
15 | 537b84c8c1 |
hex | 2eda6d71af |
201233101231 has 4 divisors (see below), whose sum is σ = 201516928600. Its totient is φ = 200949273864.
The previous prime is 201233101219. The next prime is 201233101249. The reversal of 201233101231 is 132101332102.
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 201233101231 - 211 = 201233099183 is a prime.
It is a super-2 number, since 2×2012331012312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201233101199 and 201233101208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201233104231) 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, 141912621 + ... + 141914038.
It is an arithmetic number, because the mean of its divisors is an integer number (50379232150).
Almost surely, 2201233101231 is an apocalyptic number.
201233101231 is a deficient number, since it is larger than the sum of its proper divisors (283827369).
201233101231 is an equidigital number, since it uses as much as digits as its factorization.
201233101231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 283827368.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 201233101231 its reverse (132101332102), we get a palindrome (333334433333).
The spelling of 201233101231 in words is "two hundred one billion, two hundred thirty-three million, one hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •