Base | Representation |
---|---|
bin | 11001001111010001110101… |
… | …001100011110010100010001 |
3 | 112120000121020120200220102000 |
4 | 121033101311030132110101 |
5 | 104022120223324031001 |
6 | 1032025111332344213 |
7 | 32244364521604140 |
oct | 3117216514362421 |
9 | 476017216626360 |
10 | 111001101002001 |
11 | 324063367a51a1 |
12 | 10548910175069 |
13 | 49c24886aba72 |
14 | 1d5a6a66a7757 |
15 | cc75d795ba86 |
hex | 64f47531e511 |
111001101002001 has 64 divisors (see below), whose sum is σ = 189797234880000. Its totient is φ = 62802660704256.
The previous prime is 111001101001907. The next prime is 111001101002017. The reversal of 111001101002001 is 100200101100111.
It is not a de Polignac number, because 111001101002001 - 218 = 111001100739857 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (111001101002041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 27114765 + ... + 30938853.
It is an arithmetic number, because the mean of its divisors is an integer number (2965581795000).
Almost surely, 2111001101002001 is an apocalyptic number.
It is an amenable number.
111001101002001 is a deficient number, since it is larger than the sum of its proper divisors (78796133877999).
111001101002001 is a wasteful number, since it uses less digits than its factorization.
111001101002001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3825623 (or 3825617 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 111001101002001 its reverse (100200101100111), we get a palindrome (211201202102112).
The spelling of 111001101002001 in words is "one hundred eleven trillion, one billion, one hundred one million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •