Base | Representation |
---|---|
bin | 110100101000010110… |
… | …1011000000101101001 |
3 | 101210201210010120110202 |
4 | 1221100231120011221 |
5 | 3322432421101441 |
6 | 123531103521545 |
7 | 11110551352055 |
oct | 1512055300551 |
9 | 353653116422 |
10 | 113023222121 |
11 | 43a29731697 |
12 | 19aa32b92b5 |
13 | a872952334 |
14 | 5682912c65 |
15 | 2e1772719b |
hex | 1a50b58169 |
113023222121 has 8 divisors (see below), whose sum is σ = 118410465024. Its totient is φ = 107744812560.
The previous prime is 113023222111. The next prime is 113023222157. The reversal of 113023222121 is 121222320311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113023222121 is a prime.
It is a super-2 number, since 2×1130232221212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113023222093 and 113023222102.
It is not an unprimeable number, because it can be changed into a prime (113023222111) 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, 27206210 + ... + 27210363.
It is an arithmetic number, because the mean of its divisors is an integer number (14801308128).
Almost surely, 2113023222121 is an apocalyptic number.
It is an amenable number.
113023222121 is a deficient number, since it is larger than the sum of its proper divisors (5387242903).
113023222121 is an equidigital number, since it uses as much as digits as its factorization.
113023222121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54416671.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 113023222121 its reverse (121222320311), we get a palindrome (234245542432).
The spelling of 113023222121 in words is "one hundred thirteen billion, twenty-three million, two hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •