Base | Representation |
---|---|
bin | 10000001011110100111… |
… | …000110101001111111011 |
3 | 10221022210211112011210201 |
4 | 100023310320311033323 |
5 | 121210301241214433 |
6 | 2210535310223031 |
7 | 143232413606233 |
oct | 20136470651773 |
9 | 3838724464721 |
10 | 1112210101243 |
11 | 39975a67485a |
12 | 15b678ab4a77 |
13 | 80b5b622a57 |
14 | 3bb8cd76cc3 |
15 | 1dde78c3a7d |
hex | 102f4e353fb |
1112210101243 has 2 divisors, whose sum is σ = 1112210101244. Its totient is φ = 1112210101242.
The previous prime is 1112210101237. The next prime is 1112210101297. The reversal of 1112210101243 is 3421010122111.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1112210101243 - 217 = 1112209970171 is a prime.
It is a super-2 number, since 2×11122101012432 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1112210101243.
It is not a weakly prime, because it can be changed into another prime (1112210101043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556105050621 + 556105050622.
It is an arithmetic number, because the mean of its divisors is an integer number (556105050622).
Almost surely, 21112210101243 is an apocalyptic number.
1112210101243 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112210101243 is an equidigital number, since it uses as much as digits as its factorization.
1112210101243 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 1112210101243 its reverse (3421010122111), we get a palindrome (4533220223354).
The spelling of 1112210101243 in words is "one trillion, one hundred twelve billion, two hundred ten million, one hundred one thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •