Base | Representation |
---|---|
bin | 110011110011000000… |
… | …1000011110110100001 |
3 | 101122010000221001011221 |
4 | 1213212001003312201 |
5 | 3310301201020001 |
6 | 123033321535041 |
7 | 11015314525021 |
oct | 1474601036641 |
9 | 348100831157 |
10 | 111233220001 |
11 | 431a02865a2 |
12 | 19683944481 |
13 | a648b52b97 |
14 | 5552cbda81 |
15 | 2d604e61a1 |
hex | 19e6043da1 |
111233220001 has 2 divisors, whose sum is σ = 111233220002. Its totient is φ = 111233220000.
The previous prime is 111233219963. The next prime is 111233220017. The reversal of 111233220001 is 100022332111.
It is an a-pointer prime, because the next prime (111233220017) can be obtained adding 111233220001 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 82842654976 + 28390565025 = 287824^2 + 168495^2 .
It is a cyclic number.
It is not a de Polignac number, because 111233220001 - 213 = 111233211809 is a prime.
It is not a weakly prime, because it can be changed into another prime (111233220061) 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, 55616610000 + 55616610001.
It is an arithmetic number, because the mean of its divisors is an integer number (55616610001).
Almost surely, 2111233220001 is an apocalyptic number.
It is an amenable number.
111233220001 is a deficient number, since it is larger than the sum of its proper divisors (1).
111233220001 is an equidigital number, since it uses as much as digits as its factorization.
111233220001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 111233220001 its reverse (100022332111), we get a palindrome (211255552112).
The spelling of 111233220001 in words is "one hundred eleven billion, two hundred thirty-three million, two hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •