Base | Representation |
---|---|
bin | 110100001001110111… |
… | …0000110000011010101 |
3 | 101201002110202111220001 |
4 | 1220103232012003111 |
5 | 3313334000001323 |
6 | 123241352411301 |
7 | 11043315202603 |
oct | 1502356060325 |
9 | 351073674801 |
10 | 112000000213 |
11 | 43554097952 |
12 | 198586a6b31 |
13 | a73b97439a |
14 | 55c6a7c873 |
15 | 2da79aa3ad |
hex | 1a13b860d5 |
112000000213 has 2 divisors, whose sum is σ = 112000000214. Its totient is φ = 112000000212.
The previous prime is 112000000201. The next prime is 112000000237. The reversal of 112000000213 is 312000000211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 107372871684 + 4627128529 = 327678^2 + 68023^2 .
It is a cyclic number.
It is not a de Polignac number, because 112000000213 - 225 = 111966445781 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112000000213.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112000000513) 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, 56000000106 + 56000000107.
It is an arithmetic number, because the mean of its divisors is an integer number (56000000107).
Almost surely, 2112000000213 is an apocalyptic number.
It is an amenable number.
112000000213 is a deficient number, since it is larger than the sum of its proper divisors (1).
112000000213 is an equidigital number, since it uses as much as digits as its factorization.
112000000213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 112000000213 its reverse (312000000211), we get a palindrome (424000000424).
The spelling of 112000000213 in words is "one hundred twelve billion, two hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •