Base | Representation |
---|---|
bin | 11001110000111010000010… |
… | …010010100010110011100101 |
3 | 112212012112010000111220122110 |
4 | 121300322002102202303211 |
5 | 104323001000323233214 |
6 | 1040554453054551233 |
7 | 32603344213423230 |
oct | 3160720222426345 |
9 | 485175100456573 |
10 | 113312013102309 |
11 | 3311739a3a379a |
12 | 10860763b08519 |
13 | 4b2c37a701408 |
14 | 1dda48b608417 |
15 | d1778b0c3159 |
hex | 670e824a2ce5 |
113312013102309 has 8 divisors (see below), whose sum is σ = 172665924727360. Its totient is φ = 64749721772736.
The previous prime is 113312013102307. The next prime is 113312013102341. The reversal of 113312013102309 is 903201310213311.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 113312013102309 - 21 = 113312013102307 is a prime.
It is a super-2 number, since 2×1133120131023092 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113312013102307) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2697905073844 + ... + 2697905073885.
It is an arithmetic number, because the mean of its divisors is an integer number (21583240590920).
Almost surely, 2113312013102309 is an apocalyptic number.
It is an amenable number.
113312013102309 is a deficient number, since it is larger than the sum of its proper divisors (59353911625051).
113312013102309 is an equidigital number, since it uses as much as digits as its factorization.
113312013102309 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5395810147739.
The product of its (nonzero) digits is 2916, while the sum is 30.
The spelling of 113312013102309 in words is "one hundred thirteen trillion, three hundred twelve billion, thirteen million, one hundred two thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •