Base | Representation |
---|---|
bin | 110100110000111010… |
… | …0000111100110111101 |
3 | 101211110210010200021022 |
4 | 1221201310013212331 |
5 | 3324024402433201 |
6 | 124015354513525 |
7 | 11120634554012 |
oct | 1514164074675 |
9 | 354423120238 |
10 | 113310202301 |
11 | 4406672309a |
12 | 19b634358a5 |
13 | a8ba241baa |
14 | 56aca97709 |
15 | 2e32a1341b |
hex | 1a61d079bd |
113310202301 has 4 divisors (see below), whose sum is σ = 113345983872. Its totient is φ = 113274420732.
The previous prime is 113310202297. The next prime is 113310202307. The reversal of 113310202301 is 103202013311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 113310202301 - 22 = 113310202297 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 113310202301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113310202307) 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, 17886035 + ... + 17892368.
It is an arithmetic number, because the mean of its divisors is an integer number (28336495968).
Almost surely, 2113310202301 is an apocalyptic number.
It is an amenable number.
113310202301 is a deficient number, since it is larger than the sum of its proper divisors (35781571).
113310202301 is an equidigital number, since it uses as much as digits as its factorization.
113310202301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35781570.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 113310202301 its reverse (103202013311), we get a palindrome (216512215612).
The spelling of 113310202301 in words is "one hundred thirteen billion, three hundred ten million, two hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •