Base | Representation |
---|---|
bin | 1011101101100010010… |
… | …1111000000010011101 |
3 | 201020100010122000100002 |
4 | 2323120211320002131 |
5 | 11244030242200013 |
6 | 232233035344045 |
7 | 20351660233646 |
oct | 2733045700235 |
9 | 636303560302 |
10 | 201202303133 |
11 | 78369500357 |
12 | 32bb22b2025 |
13 | 15c8643ba50 |
14 | 9a49a506cd |
15 | 5378cb7358 |
hex | 2ed897809d |
201202303133 has 16 divisors (see below), whose sum is σ = 218137258752. Its totient is φ = 184479768000.
The previous prime is 201202303097. The next prime is 201202303171. The reversal of 201202303133 is 331303202102.
201202303133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 201202303133 - 220 = 201201254557 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201202303433) 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 15 ways as a sum of consecutive naturals, for example, 1079843 + ... + 1252383.
It is an arithmetic number, because the mean of its divisors is an integer number (13633578672).
Almost surely, 2201202303133 is an apocalyptic number.
It is an amenable number.
201202303133 is a deficient number, since it is larger than the sum of its proper divisors (16934955619).
201202303133 is a wasteful number, since it uses less digits than its factorization.
201202303133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173156.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 201202303133 its reverse (331303202102), we get a palindrome (532505505235).
The spelling of 201202303133 in words is "two hundred one billion, two hundred two million, three hundred three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •