Base | Representation |
---|---|
bin | 1011110001101101101… |
… | …0010000100011110001 |
3 | 201100020021001010220022 |
4 | 2330123122100203301 |
5 | 11303324233100223 |
6 | 232540203053225 |
7 | 20421521640455 |
oct | 2743332204361 |
9 | 640207033808 |
10 | 202323331313 |
11 | 78894278424 |
12 | 33265811215 |
13 | 16104772b2c |
14 | 9b148a4665 |
15 | 53e2403ac8 |
hex | 2f1b6908f1 |
202323331313 has 16 divisors (see below), whose sum is σ = 210298200000. Its totient is φ = 194415705792.
The previous prime is 202323331241. The next prime is 202323331321. The reversal of 202323331313 is 313133323202.
It is a happy number.
202323331313 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 202323331313 - 214 = 202323314929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (202323331813) 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, 23232506 + ... + 23241212.
It is an arithmetic number, because the mean of its divisors is an integer number (13143637500).
Almost surely, 2202323331313 is an apocalyptic number.
It is an amenable number.
202323331313 is a deficient number, since it is larger than the sum of its proper divisors (7974868687).
202323331313 is a wasteful number, since it uses less digits than its factorization.
202323331313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12464.
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 202323331313 its reverse (313133323202), we get a palindrome (515456654515).
The spelling of 202323331313 in words is "two hundred two billion, three hundred twenty-three million, three hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •