Base | Representation |
---|---|
bin | 1001100110001001111010… |
… | …01001100001110010100001 |
3 | 2202201100110121122200211002 |
4 | 10303010331021201302201 |
5 | 10231214301224424441 |
6 | 112514114510201345 |
7 | 4305404123306150 |
oct | 463047511416241 |
9 | 82640417580732 |
10 | 21102200233121 |
11 | 67a6435997807 |
12 | 24498b81b3255 |
13 | ba0c0cb727a7 |
14 | 52d4cda23597 |
15 | 268db3a9cb9b |
hex | 13313d261ca1 |
21102200233121 has 8 divisors (see below), whose sum is σ = 24127581151680. Its totient is φ = 18079514535888.
The previous prime is 21102200233099. The next prime is 21102200233123. The reversal of 21102200233121 is 12133200220112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21102200233121 - 26 = 21102200233057 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21102200233093 and 21102200233102.
It is not an unprimeable number, because it can be changed into a prime (21102200233123) 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, 673788551 + ... + 673819868.
It is an arithmetic number, because the mean of its divisors is an integer number (3015947643960).
Almost surely, 221102200233121 is an apocalyptic number.
It is an amenable number.
21102200233121 is a deficient number, since it is larger than the sum of its proper divisors (3025380918559).
21102200233121 is a wasteful number, since it uses less digits than its factorization.
21102200233121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1347610663.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 21102200233121 its reverse (12133200220112), we get a palindrome (33235400453233).
The spelling of 21102200233121 in words is "twenty-one trillion, one hundred two billion, two hundred million, two hundred thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •