Base | Representation |
---|---|
bin | 1001101001011010001100… |
… | …11100000111010110011101 |
3 | 2210010001002220011010222111 |
4 | 10310231012130013112131 |
5 | 10240032310431001310 |
6 | 113041331052314021 |
7 | 4316443215260134 |
oct | 464550634072635 |
9 | 83101086133874 |
10 | 21214025250205 |
11 | 68398aa2291a7 |
12 | 2467506172911 |
13 | bab6214ab658 |
14 | 534a9b35291b |
15 | 26bc5aee128a |
hex | 134b4670759d |
21214025250205 has 16 divisors (see below), whose sum is σ = 26078538279024. Its totient is φ = 16556773918720.
The previous prime is 21214025250181. The next prime is 21214025250211. The reversal of 21214025250205 is 50205252041212.
It can be written as a sum of positive squares in 8 ways, for example, as 15702301787769 + 5511723462436 = 3962613^2 + 2347706^2 .
It is not a de Polignac number, because 21214025250205 - 29 = 21214025249693 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 5079849 + ... + 8260321.
It is an arithmetic number, because the mean of its divisors is an integer number (1629908642439).
Almost surely, 221214025250205 is an apocalyptic number.
It is an amenable number.
21214025250205 is a deficient number, since it is larger than the sum of its proper divisors (4864513028819).
21214025250205 is a wasteful number, since it uses less digits than its factorization.
21214025250205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3213056.
The product of its (nonzero) digits is 16000, while the sum is 31.
Adding to 21214025250205 its reverse (50205252041212), we get a palindrome (71419277291417).
The spelling of 21214025250205 in words is "twenty-one trillion, two hundred fourteen billion, twenty-five million, two hundred fifty thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •