Base | Representation |
---|---|
bin | 110011110010000011… |
… | …0001110100010110001 |
3 | 101122000210100010012022 |
4 | 1213210012032202301 |
5 | 3310214430120311 |
6 | 123030211441225 |
7 | 11014444034504 |
oct | 1474406164261 |
9 | 348023303168 |
10 | 111201020081 |
11 | 43184093298 |
12 | 19674bb6215 |
13 | a64228a788 |
14 | 554c8db13b |
15 | 2d5c7855db |
hex | 19e418e8b1 |
111201020081 has 2 divisors, whose sum is σ = 111201020082. Its totient is φ = 111201020080.
The previous prime is 111201020059. The next prime is 111201020129. The reversal of 111201020081 is 180020102111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99099040000 + 12101980081 = 314800^2 + 110009^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111201020081 is a prime.
It is a super-2 number, since 2×1112010200812 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (111201020981) 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, 55600510040 + 55600510041.
It is an arithmetic number, because the mean of its divisors is an integer number (55600510041).
Almost surely, 2111201020081 is an apocalyptic number.
It is an amenable number.
111201020081 is a deficient number, since it is larger than the sum of its proper divisors (1).
111201020081 is an equidigital number, since it uses as much as digits as its factorization.
111201020081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 111201020081 its reverse (180020102111), we get a palindrome (291221122192).
The spelling of 111201020081 in words is "one hundred eleven billion, two hundred one million, twenty thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •