Base | Representation |
---|---|
bin | 110100110001010010… |
… | …1000001001100111101 |
3 | 101211111200020221101021 |
4 | 1221202211001030331 |
5 | 3324041143133432 |
6 | 124020533344141 |
7 | 11121151533445 |
oct | 1514245011475 |
9 | 354450227337 |
10 | 113323021117 |
11 | 44072989059 |
12 | 19b67798051 |
13 | a8bcaac7a7 |
14 | 56b0673125 |
15 | 2e33be6697 |
hex | 1a6294133d |
113323021117 has 2 divisors, whose sum is σ = 113323021118. Its totient is φ = 113323021116.
The previous prime is 113323021093. The next prime is 113323021151. The reversal of 113323021117 is 711120323311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 111765850596 + 1557170521 = 334314^2 + 39461^2 .
It is a cyclic number.
It is not a de Polignac number, because 113323021117 - 27 = 113323020989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113323021091 and 113323021100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113323031117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56661510558 + 56661510559.
It is an arithmetic number, because the mean of its divisors is an integer number (56661510559).
Almost surely, 2113323021117 is an apocalyptic number.
It is an amenable number.
113323021117 is a deficient number, since it is larger than the sum of its proper divisors (1).
113323021117 is an equidigital number, since it uses as much as digits as its factorization.
113323021117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 25.
Adding to 113323021117 its reverse (711120323311), we get a palindrome (824443344428).
The spelling of 113323021117 in words is "one hundred thirteen billion, three hundred twenty-three million, twenty-one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •