Base | Representation |
---|---|
bin | 11001101100101100001110… |
… | …111001010100001001100011 |
3 | 112211011211100102002221120212 |
4 | 121230230032321110021203 |
5 | 104303224144430100003 |
6 | 1040213422344124335 |
7 | 32543410211301113 |
oct | 3154541671241143 |
9 | 484154312087525 |
10 | 113022314300003 |
11 | 33015548a33819 |
12 | 108145944666ab |
13 | 4b0ac5cab9c74 |
14 | 1dca448631043 |
15 | d0ee82e6add8 |
hex | 66cb0ee54263 |
113022314300003 has 8 divisors (see below), whose sum is σ = 113559913349136. Its totient is φ = 112484733631200.
The previous prime is 113022314299931. The next prime is 113022314300041. The reversal of 113022314300003 is 300003413220311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 113022314300003 - 28 = 113022314299747 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113022314300053) 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 7 ways as a sum of consecutive naturals, for example, 7811825 + ... + 16943117.
It is an arithmetic number, because the mean of its divisors is an integer number (14194989168642).
Almost surely, 2113022314300003 is an apocalyptic number.
113022314300003 is a deficient number, since it is larger than the sum of its proper divisors (537599049133).
113022314300003 is an equidigital number, since it uses as much as digits as its factorization.
113022314300003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9190165.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 113022314300003 its reverse (300003413220311), we get a palindrome (413025727520314).
The spelling of 113022314300003 in words is "one hundred thirteen trillion, twenty-two billion, three hundred fourteen million, three hundred thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •