Base | Representation |
---|---|
bin | 110100001100111011… |
… | …1001000010110010101 |
3 | 101201100122122002020001 |
4 | 1220121313020112111 |
5 | 3314041334012323 |
6 | 123255513011301 |
7 | 11046006023464 |
oct | 1503167102625 |
9 | 351318562201 |
10 | 112103032213 |
11 | 435a726a367 |
12 | 198870b3b31 |
13 | a757109c73 |
14 | 55d661c9db |
15 | 2db1a5d3ad |
hex | 1a19dc8595 |
112103032213 has 2 divisors, whose sum is σ = 112103032214. Its totient is φ = 112103032212.
The previous prime is 112103032193. The next prime is 112103032231. The reversal of 112103032213 is 312230301211.
Together with next prime (112103032231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 67393198404 + 44709833809 = 259602^2 + 211447^2 .
It is an emirp because it is prime and its reverse (312230301211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112103032213 - 29 = 112103031701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112103032513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56051516106 + 56051516107.
It is an arithmetic number, because the mean of its divisors is an integer number (56051516107).
Almost surely, 2112103032213 is an apocalyptic number.
It is an amenable number.
112103032213 is a deficient number, since it is larger than the sum of its proper divisors (1).
112103032213 is an equidigital number, since it uses as much as digits as its factorization.
112103032213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 112103032213 its reverse (312230301211), we get a palindrome (424333333424).
The spelling of 112103032213 in words is "one hundred twelve billion, one hundred three million, thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •