Base | Representation |
---|---|
bin | 110100110010100001… |
… | …0111100011011010111 |
3 | 101211121120011020101202 |
4 | 1221211002330123113 |
5 | 3324132242422221 |
6 | 124025012543115 |
7 | 11122163450012 |
oct | 1514502743327 |
9 | 354546136352 |
10 | 113364420311 |
11 | 4409429496a |
12 | 19b79621a9b |
13 | a8c854615c |
14 | 56b5d6c379 |
15 | 2e37672d0b |
hex | 1a650bc6d7 |
113364420311 has 4 divisors (see below), whose sum is σ = 113365426824. Its totient is φ = 113363413800.
The previous prime is 113364420307. The next prime is 113364420317. The reversal of 113364420311 is 113024463311.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 113024463311 = 79 ⋅1430689409.
It is a cyclic number.
It is not a de Polignac number, because 113364420311 - 22 = 113364420307 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 (113364420317) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 309425 + ... + 567866.
It is an arithmetic number, because the mean of its divisors is an integer number (28341356706).
Almost surely, 2113364420311 is an apocalyptic number.
113364420311 is a deficient number, since it is larger than the sum of its proper divisors (1006513).
113364420311 is an equidigital number, since it uses as much as digits as its factorization.
113364420311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1006512.
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 113364420311 its reverse (113024463311), we get a palindrome (226388883622).
The spelling of 113364420311 in words is "one hundred thirteen billion, three hundred sixty-four million, four hundred twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •