Base | Representation |
---|---|
bin | 1011101101100010000… |
… | …1010101100010010001 |
3 | 201020100001101120002201 |
4 | 2323120201111202101 |
5 | 11244024441110413 |
6 | 232232554043201 |
7 | 20351644146601 |
oct | 2733041254221 |
9 | 636301346081 |
10 | 201201113233 |
11 | 7836886836a |
12 | 32bb1a19501 |
13 | 15c86113273 |
14 | 9a49820c01 |
15 | 5378b2e9dd |
hex | 2ed8855891 |
201201113233 has 8 divisors (see below), whose sum is σ = 202144662720. Its totient is φ = 200259435600.
The previous prime is 201201113227. The next prime is 201201113249. The reversal of 201201113233 is 332311102102.
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 201201113233 - 237 = 63762159761 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 201201113233.
It is not an unprimeable number, because it can be changed into a prime (201201113273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 252253 + ... + 682666.
It is an arithmetic number, because the mean of its divisors is an integer number (25268082840).
Almost surely, 2201201113233 is an apocalyptic number.
It is an amenable number.
201201113233 is a deficient number, since it is larger than the sum of its proper divisors (943549487).
201201113233 is an equidigital number, since it uses as much as digits as its factorization.
201201113233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 935927.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 201201113233 its reverse (332311102102), we get a palindrome (533512215335).
The spelling of 201201113233 in words is "two hundred one billion, two hundred one million, one hundred thirteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •