Base | Representation |
---|---|
bin | 110100101101101100… |
… | …0100101001111000011 |
3 | 101211012021010201000111 |
4 | 1221123120211033003 |
5 | 3323314243222243 |
6 | 124000542332151 |
7 | 11115154563211 |
oct | 1513330451703 |
9 | 354167121014 |
10 | 113202320323 |
11 | 44010838834 |
12 | 19b3328a057 |
13 | a8a0a9b8c1 |
14 | 569c613cb1 |
15 | 2e2830339d |
hex | 1a5b6253c3 |
113202320323 has 32 divisors (see below), whose sum is σ = 129102361920. Its totient is φ = 98714112000.
The previous prime is 113202320293. The next prime is 113202320347. The reversal of 113202320323 is 323023202311.
It is a cyclic number.
It is not a de Polignac number, because 113202320323 - 229 = 112665449411 is a prime.
It is a super-2 number, since 2×1132023203232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113202320294 and 113202320303.
It is not an unprimeable number, because it can be changed into a prime (113202320923) 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 31 ways as a sum of consecutive naturals, for example, 1187088 + ... + 1278898.
It is an arithmetic number, because the mean of its divisors is an integer number (4034448810).
Almost surely, 2113202320323 is an apocalyptic number.
113202320323 is a deficient number, since it is larger than the sum of its proper divisors (15900041597).
113202320323 is a wasteful number, since it uses less digits than its factorization.
113202320323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91959.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 113202320323 its reverse (323023202311), we get a palindrome (436225522634).
The spelling of 113202320323 in words is "one hundred thirteen billion, two hundred two million, three hundred twenty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •