Base | Representation |
---|---|
bin | 11001010000101111110011… |
… | …001111100111001111010001 |
3 | 112120101020200101222011211000 |
4 | 121100233303033213033101 |
5 | 104030243344000031001 |
6 | 1032143315412212213 |
7 | 32254566063134661 |
oct | 3120576317471721 |
9 | 476336611864730 |
10 | 111102000002001 |
11 | 3244510363a2a8 |
12 | 1056438b00a069 |
13 | 49cbb48524968 |
14 | 1d61518ca41a1 |
15 | cca040a76a86 |
hex | 650bf33e73d1 |
111102000002001 has 16 divisors (see below), whose sum is σ = 168423359177920. Its totient is φ = 72345488372640.
The previous prime is 111102000001987. The next prime is 111102000002041. The reversal of 111102000002001 is 100200000201111.
It is a happy number.
It is not a de Polignac number, because 111102000002001 - 27 = 111102000001873 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (111102000002041) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 47847544060 + ... + 47847546381.
It is an arithmetic number, because the mean of its divisors is an integer number (10526459948620).
Almost surely, 2111102000002001 is an apocalyptic number.
It is an amenable number.
111102000002001 is a deficient number, since it is larger than the sum of its proper divisors (57321359175919).
111102000002001 is an equidigital number, since it uses as much as digits as its factorization.
111102000002001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95695090493 (or 95695090487 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 111102000002001 its reverse (100200000201111), we get a palindrome (211302000203112).
The spelling of 111102000002001 in words is "one hundred eleven trillion, one hundred two billion, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •