Base | Representation |
---|---|
bin | 11001101101111111111000… |
… | …011010000001111010010101 |
3 | 112211111102011220122222010221 |
4 | 121231333320122001322111 |
5 | 104311212121104011201 |
6 | 1040322555030314341 |
7 | 32553040026306541 |
oct | 3155777032017225 |
9 | 484442156588127 |
10 | 113112131313301 |
11 | 3304a64933222a |
12 | 10829a7bab89b1 |
13 | 4b16574a30a93 |
14 | 1dd09290d8a21 |
15 | d1248d1ee4a1 |
hex | 66dff8681e95 |
113112131313301 has 8 divisors (see below), whose sum is σ = 114612317820000. Its totient is φ = 111621592308720.
The previous prime is 113112131313289. The next prime is 113112131313317. The reversal of 113112131313301 is 103313131211311.
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 113112131313301 - 211 = 113112131311253 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 (113112131913301) 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, 2411851926 + ... + 2411898823.
It is an arithmetic number, because the mean of its divisors is an integer number (14326539727500).
Almost surely, 2113112131313301 is an apocalyptic number.
It is an amenable number.
113112131313301 is a deficient number, since it is larger than the sum of its proper divisors (1500186506699).
113112131313301 is a wasteful number, since it uses less digits than its factorization.
113112131313301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4823751059.
The product of its (nonzero) digits is 486, while the sum is 25.
Adding to 113112131313301 its reverse (103313131211311), we get a palindrome (216425262524612).
The spelling of 113112131313301 in words is "one hundred thirteen trillion, one hundred twelve billion, one hundred thirty-one million, three hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •