Base | Representation |
---|---|
bin | 110100010011001100… |
… | …0100001111011010001 |
3 | 101201220021221100200212 |
4 | 1220212120201323101 |
5 | 3320004124124241 |
6 | 123332415453505 |
7 | 11054136501662 |
oct | 1504630417321 |
9 | 351807840625 |
10 | 112313114321 |
11 | 436a4909141 |
12 | 19925527295 |
13 | a78b7b42c5 |
14 | 56164a7369 |
15 | 2dc5209beb |
hex | 1a26621ed1 |
112313114321 has 2 divisors, whose sum is σ = 112313114322. Its totient is φ = 112313114320.
The previous prime is 112313114281. The next prime is 112313114369. The reversal of 112313114321 is 123411313211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 97383940096 + 14929174225 = 312064^2 + 122185^2 .
It is a cyclic number.
It is not a de Polignac number, because 112313114321 - 26 = 112313114257 is a prime.
It is a super-2 number, since 2×1123131143212 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (112313114371) 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, 56156557160 + 56156557161.
It is an arithmetic number, because the mean of its divisors is an integer number (56156557161).
Almost surely, 2112313114321 is an apocalyptic number.
It is an amenable number.
112313114321 is a deficient number, since it is larger than the sum of its proper divisors (1).
112313114321 is an equidigital number, since it uses as much as digits as its factorization.
112313114321 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 432, while the sum is 23.
Adding to 112313114321 its reverse (123411313211), we get a palindrome (235724427532).
The spelling of 112313114321 in words is "one hundred twelve billion, three hundred thirteen million, one hundred fourteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •