Base | Representation |
---|---|
bin | 1001110100101101101111… |
… | …00111010000001101100111 |
3 | 2211111011202100110102220110 |
4 | 10322112313213100031213 |
5 | 10312413330042132020 |
6 | 113540012130104103 |
7 | 4356504241150401 |
oct | 472266747201547 |
9 | 84434670412813 |
10 | 21602471052135 |
11 | 6979613808576 |
12 | 250a853a1b033 |
13 | c091481420ac |
14 | 5497cabc1b71 |
15 | 276de33788e0 |
hex | 13a5b79d0367 |
21602471052135 has 8 divisors (see below), whose sum is σ = 34563953683440. Its totient is φ = 11521317894464.
The previous prime is 21602471052133. The next prime is 21602471052167. The reversal of 21602471052135 is 53125017420612.
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 21602471052135 - 21 = 21602471052133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21602471052093 and 21602471052102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21602471052133) 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, 720082368390 + ... + 720082368419.
It is an arithmetic number, because the mean of its divisors is an integer number (4320494210430).
Almost surely, 221602471052135 is an apocalyptic number.
21602471052135 is a deficient number, since it is larger than the sum of its proper divisors (12961482631305).
21602471052135 is a wasteful number, since it uses less digits than its factorization.
21602471052135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1440164736817.
The product of its (nonzero) digits is 100800, while the sum is 39.
Adding to 21602471052135 its reverse (53125017420612), we get a palindrome (74727488472747).
The spelling of 21602471052135 in words is "twenty-one trillion, six hundred two billion, four hundred seventy-one million, fifty-two thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •