Base | Representation |
---|---|
bin | 110100101000010100… |
… | …0110000001100000101 |
3 | 101210201200211222220201 |
4 | 1221100220300030011 |
5 | 3322432113310432 |
6 | 123531021530501 |
7 | 11110535143402 |
oct | 1512050601405 |
9 | 353650758821 |
10 | 113022010117 |
11 | 43a28a84035 |
12 | 19aa2a13a31 |
13 | a872619783 |
14 | 56826b92a9 |
15 | 2e17587ee7 |
hex | 1a50a30305 |
113022010117 has 2 divisors, whose sum is σ = 113022010118. Its totient is φ = 113022010116.
The previous prime is 113022010099. The next prime is 113022010147. The reversal of 113022010117 is 711010220311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 83942893441 + 29079116676 = 289729^2 + 170526^2 .
It is a cyclic number.
It is not a de Polignac number, because 113022010117 - 227 = 112887792389 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113022010094 and 113022010103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113022010147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56511005058 + 56511005059.
It is an arithmetic number, because the mean of its divisors is an integer number (56511005059).
Almost surely, 2113022010117 is an apocalyptic number.
It is an amenable number.
113022010117 is a deficient number, since it is larger than the sum of its proper divisors (1).
113022010117 is an equidigital number, since it uses as much as digits as its factorization.
113022010117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84, while the sum is 19.
Adding to 113022010117 its reverse (711010220311), we get a palindrome (824032230428).
The spelling of 113022010117 in words is "one hundred thirteen billion, twenty-two million, ten thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •