Base | Representation |
---|---|
bin | 11001110000111011001010… |
… | …110100101110101000110101 |
3 | 112212012122020211100220022100 |
4 | 121300323022310232220311 |
5 | 104323010443341220341 |
6 | 1040555213525452313 |
7 | 32603416321164504 |
oct | 3160731264565065 |
9 | 485178224326270 |
10 | 113313230023221 |
11 | 33117964307458 |
12 | 10860a43571099 |
13 | 4b2c51286b667 |
14 | 1dda5650a083b |
15 | d1780cd523b6 |
hex | 670ecad2ea35 |
113313230023221 has 48 divisors (see below), whose sum is σ = 174282891269760. Its totient is φ = 70696376540160.
The previous prime is 113313230023219. The next prime is 113313230023241. The reversal of 113313230023221 is 122320032313311.
113313230023221 is a `hidden beast` number, since 1 + 1 + 3 + 3 + 1 + 32 + 300 + 2 + 322 + 1 = 666.
It is not a de Polignac number, because 113313230023221 - 21 = 113313230023219 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113313230023241) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 415077856 + ... + 415350758.
It is an arithmetic number, because the mean of its divisors is an integer number (3630893568120).
Almost surely, 2113313230023221 is an apocalyptic number.
It is an amenable number.
113313230023221 is a deficient number, since it is larger than the sum of its proper divisors (60969661246539).
113313230023221 is a wasteful number, since it uses less digits than its factorization.
113313230023221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 288266 (or 288263 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 27.
Adding to 113313230023221 its reverse (122320032313311), we get a palindrome (235633262336532).
The spelling of 113313230023221 in words is "one hundred thirteen trillion, three hundred thirteen billion, two hundred thirty million, twenty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •