Base | Representation |
---|---|
bin | 110011110000110110… |
… | …1100010100011000111 |
3 | 101121221000000120201112 |
4 | 1213201231202203013 |
5 | 3310124203301431 |
6 | 123022221515235 |
7 | 11013446600405 |
oct | 1474155424307 |
9 | 347830016645 |
10 | 111160993991 |
11 | 43163535083 |
12 | 19663712b1b |
13 | a636bb50b8 |
14 | 554747c475 |
15 | 2d58ecac2b |
hex | 19e1b628c7 |
111160993991 has 2 divisors, whose sum is σ = 111160993992. Its totient is φ = 111160993990.
The previous prime is 111160993981. The next prime is 111160994041. The reversal of 111160993991 is 199399061111.
It is an a-pointer prime, because the next prime (111160994041) can be obtained adding 111160993991 to its sum of digits (50).
It is a weak prime.
It is an emirp because it is prime and its reverse (199399061111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 111160993991 - 26 = 111160993927 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111160993921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55580496995 + 55580496996.
It is an arithmetic number, because the mean of its divisors is an integer number (55580496996).
Almost surely, 2111160993991 is an apocalyptic number.
111160993991 is a deficient number, since it is larger than the sum of its proper divisors (1).
111160993991 is an equidigital number, since it uses as much as digits as its factorization.
111160993991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 118098, while the sum is 50.
The spelling of 111160993991 in words is "one hundred eleven billion, one hundred sixty million, nine hundred ninety-three thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •