Base | Representation |
---|---|
bin | 11001001111010010110000… |
… | …110000000111101010001001 |
3 | 112120000200211012212112021212 |
4 | 121033102300300013222021 |
5 | 104022124300122431441 |
6 | 1032025354424542505 |
7 | 32244431343634052 |
oct | 3117226060075211 |
9 | 476020735775255 |
10 | 111002100202121 |
11 | 324067a9822017 |
12 | 10548b4a921a35 |
13 | 49c25b76c8b3b |
14 | 1d5a75d287729 |
15 | cc7645530eeb |
hex | 64f4b0c07a89 |
111002100202121 has 8 divisors (see below), whose sum is σ = 113583686536320. Its totient is φ = 108420520329072.
The previous prime is 111002100202073. The next prime is 111002100202139. The reversal of 111002100202121 is 121202001200111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111002100202121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111002100202096 and 111002100202105.
It is not an unprimeable number, because it can be changed into a prime (111002100202421) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61416800 + ... + 63198318.
It is an arithmetic number, because the mean of its divisors is an integer number (14197960817040).
Almost surely, 2111002100202121 is an apocalyptic number.
It is an amenable number.
111002100202121 is a deficient number, since it is larger than the sum of its proper divisors (2581586334199).
111002100202121 is a wasteful number, since it uses less digits than its factorization.
111002100202121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3230575.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 111002100202121 its reverse (121202001200111), we get a palindrome (232204101402232).
The spelling of 111002100202121 in words is "one hundred eleven trillion, two billion, one hundred million, two hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •