Base | Representation |
---|---|
bin | 100001011100011… |
… | …1110110101010001 |
3 | 2220012200101012102 |
4 | 1002320332311101 |
5 | 4244242434211 |
6 | 303205210145 |
7 | 36544554212 |
oct | 10270766521 |
9 | 2805611172 |
10 | 1122233681 |
11 | 526520858 |
12 | 273a00955 |
13 | 14b6669ca |
14 | a9089409 |
15 | 687c8a3b |
hex | 42e3ed51 |
1122233681 has 2 divisors, whose sum is σ = 1122233682. Its totient is φ = 1122233680.
The previous prime is 1122233659. The next prime is 1122233683. The reversal of 1122233681 is 1863322211.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1099585600 + 22648081 = 33160^2 + 4759^2 .
It is a cyclic number.
It is not a de Polignac number, because 1122233681 - 214 = 1122217297 is a prime.
It is a super-2 number, since 2×11222336812 = 2518816869541619522, which contains 22 as substring.
Together with 1122233683, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1122233683) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561116840 + 561116841.
It is an arithmetic number, because the mean of its divisors is an integer number (561116841).
Almost surely, 21122233681 is an apocalyptic number.
It is an amenable number.
1122233681 is a deficient number, since it is larger than the sum of its proper divisors (1).
1122233681 is an equidigital number, since it uses as much as digits as its factorization.
1122233681 is an evil number, because the sum of its binary digits is even.
The product of its digits is 3456, while the sum is 29.
The square root of 1122233681 is about 33499.7564319504. The cubic root of 1122233681 is about 1039.1887414126.
Adding to 1122233681 its reverse (1863322211), we get a palindrome (2985555892).
The spelling of 1122233681 in words is "one billion, one hundred twenty-two million, two hundred thirty-three thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •