Base | Representation |
---|---|
bin | 1011101101100010000… |
… | …1101101001101111001 |
3 | 201020100001120111011022 |
4 | 2323120201231031321 |
5 | 11244030002211413 |
6 | 232233000112225 |
7 | 20351645032442 |
oct | 2733041551571 |
9 | 636301514138 |
10 | 201201210233 |
11 | 78368924231 |
12 | 32bb1a65675 |
13 | 15c8614846a |
14 | 9a498482c9 |
15 | 5378b4d608 |
hex | 2ed886d379 |
201201210233 has 4 divisors (see below), whose sum is σ = 201202417140. Its totient is φ = 201200003328.
The previous prime is 201201210229. The next prime is 201201210269. The reversal of 201201210233 is 332012102102.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 332012102102 = 2 ⋅166006051051.
It can be written as a sum of positive squares in 2 ways, for example, as 81559934569 + 119641275664 = 285587^2 + 345892^2 .
It is a cyclic number.
It is not a de Polignac number, because 201201210233 - 22 = 201201210229 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201201270233) 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, 303788 + ... + 703341.
It is an arithmetic number, because the mean of its divisors is an integer number (50300604285).
Almost surely, 2201201210233 is an apocalyptic number.
It is an amenable number.
201201210233 is a deficient number, since it is larger than the sum of its proper divisors (1206907).
201201210233 is a wasteful number, since it uses less digits than its factorization.
201201210233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1206906.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 201201210233 its reverse (332012102102), we get a palindrome (533213312335).
The spelling of 201201210233 in words is "two hundred one billion, two hundred one million, two hundred ten thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •