Base | Representation |
---|---|
bin | 11001001111101101101100… |
… | …100100101000001011110001 |
3 | 112120010110110202122212120011 |
4 | 121033231230210220023301 |
5 | 104023113012401010001 |
6 | 1032050540312214521 |
7 | 32246504131406536 |
oct | 3117555444501361 |
9 | 476113422585504 |
10 | 111031021110001 |
11 | 32417a9a931183 |
12 | 1055268039a441 |
13 | 49c5246350995 |
14 | 1d5bd04276d8d |
15 | cc8289553d51 |
hex | 64fb6c9282f1 |
111031021110001 has 2 divisors, whose sum is σ = 111031021110002. Its totient is φ = 111031021110000.
The previous prime is 111031021109891. The next prime is 111031021110007. The reversal of 111031021110001 is 100011120130111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105165537750625 + 5865483359376 = 10255025^2 + 2421876^2 .
It is a cyclic number.
It is not a de Polignac number, because 111031021110001 - 27 = 111031021109873 is a prime.
It is a super-3 number, since 3×1110310211100013 (a number of 43 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (111031021110007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55515510555000 + 55515510555001.
It is an arithmetic number, because the mean of its divisors is an integer number (55515510555001).
Almost surely, 2111031021110001 is an apocalyptic number.
It is an amenable number.
111031021110001 is a deficient number, since it is larger than the sum of its proper divisors (1).
111031021110001 is an equidigital number, since it uses as much as digits as its factorization.
111031021110001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 111031021110001 its reverse (100011120130111), we get a palindrome (211042141240112).
The spelling of 111031021110001 in words is "one hundred eleven trillion, thirty-one billion, twenty-one million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •