Base | Representation |
---|---|
bin | 11001110000110000101101… |
… | …100010001111100110101101 |
3 | 112212011120021021101121002001 |
4 | 121300300231202033212231 |
5 | 104322314444303020023 |
6 | 1040550115405332301 |
7 | 32602541133012064 |
oct | 3160605542174655 |
9 | 485146237347061 |
10 | 113302001220013 |
11 | 33113121a03401 |
12 | 1085a82ab67091 |
13 | 4b2b4434136c8 |
14 | 1dd9bbba711db |
15 | d173a21696ad |
hex | 670c2d88f9ad |
113302001220013 has 4 divisors (see below), whose sum is σ = 113302031563840. Its totient is φ = 113301970876188.
The previous prime is 113302001220011. The next prime is 113302001220061. The reversal of 113302001220013 is 310022100203311.
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 113302001220013 - 21 = 113302001220011 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 (113302001220011) 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, 8631045 + ... + 17352202.
It is an arithmetic number, because the mean of its divisors is an integer number (28325507890960).
Almost surely, 2113302001220013 is an apocalyptic number.
It is an amenable number.
113302001220013 is a deficient number, since it is larger than the sum of its proper divisors (30343827).
113302001220013 is an equidigital number, since it uses as much as digits as its factorization.
113302001220013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30343826.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 113302001220013 its reverse (310022100203311), we get a palindrome (423324101423324).
The spelling of 113302001220013 in words is "one hundred thirteen trillion, three hundred two billion, one million, two hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •