Base | Representation |
---|---|
bin | 101110000000001011010101… |
… | …100111011001011010110001 |
3 | 222112100211020212212001011001 |
4 | 232000023111213121122301 |
5 | 203004322044202220423 |
6 | 1554145330531322001 |
7 | 60421206350661520 |
oct | 5600132547313261 |
9 | 875324225761131 |
10 | 202322313320113 |
11 | 59514458379058 |
12 | 1a837505450301 |
13 | 88b7bb238673c |
14 | 37d6648c364b7 |
15 | 185cd035e9cad |
hex | b802d59d96b1 |
202322313320113 has 32 divisors (see below), whose sum is σ = 239514543302400. Its totient is φ = 167218166363136.
The previous prime is 202322313320111. The next prime is 202322313320117. The reversal of 202322313320113 is 311023313223202.
It is a happy number.
It is not a de Polignac number, because 202322313320113 - 21 = 202322313320111 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (202322313320111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2260211445 + ... + 2260300957.
It is an arithmetic number, because the mean of its divisors is an integer number (7484829478200).
Almost surely, 2202322313320113 is an apocalyptic number.
It is an amenable number.
202322313320113 is a deficient number, since it is larger than the sum of its proper divisors (37192229982287).
202322313320113 is a wasteful number, since it uses less digits than its factorization.
202322313320113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104121.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 202322313320113 its reverse (311023313223202), we get a palindrome (513345626543315).
The spelling of 202322313320113 in words is "two hundred two trillion, three hundred twenty-two billion, three hundred thirteen million, three hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •