Base | Representation |
---|---|
bin | 110100010000110001… |
… | …1011111000111011001 |
3 | 101201200122111102101001 |
4 | 1220201203133013121 |
5 | 3314322404202223 |
6 | 123320403225001 |
7 | 11052134053354 |
oct | 1504143370731 |
9 | 351618442331 |
10 | 112232100313 |
11 | 43663105113 |
12 | 19902378161 |
13 | a777a8a518 |
14 | 560981929b |
15 | 2dbd0559ad |
hex | 1a218df1d9 |
112232100313 has 2 divisors, whose sum is σ = 112232100314. Its totient is φ = 112232100312.
The previous prime is 112232100311. The next prime is 112232100329. The reversal of 112232100313 is 313001232211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 75786235849 + 36445864464 = 275293^2 + 190908^2 .
It is an emirp because it is prime and its reverse (313001232211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112232100313 - 21 = 112232100311 is a prime.
Together with 112232100311, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (112232100311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56116050156 + 56116050157.
It is an arithmetic number, because the mean of its divisors is an integer number (56116050157).
Almost surely, 2112232100313 is an apocalyptic number.
It is an amenable number.
112232100313 is a deficient number, since it is larger than the sum of its proper divisors (1).
112232100313 is an equidigital number, since it uses as much as digits as its factorization.
112232100313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 112232100313 its reverse (313001232211), we get a palindrome (425233332524).
The spelling of 112232100313 in words is "one hundred twelve billion, two hundred thirty-two million, one hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •