Base | Representation |
---|---|
bin | 1001101111001011111011… |
… | …01011000100100000111001 |
3 | 2210211000110100211012020112 |
4 | 10313211331223010200321 |
5 | 10301310320211210431 |
6 | 113312435344434105 |
7 | 4340001134312306 |
oct | 467457553044071 |
9 | 83730410735215 |
10 | 21412520413241 |
11 | 6905aa9606091 |
12 | 2499a81918935 |
13 | bc4265b03a49 |
14 | 54052b6320ad |
15 | 271ec72b2c2b |
hex | 13797dac4839 |
21412520413241 has 2 divisors, whose sum is σ = 21412520413242. Its totient is φ = 21412520413240.
The previous prime is 21412520413159. The next prime is 21412520413279. The reversal of 21412520413241 is 14231402521412.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12573910332841 + 8838610080400 = 3545971^2 + 2972980^2 .
It is a cyclic number.
It is not a de Polignac number, because 21412520413241 - 222 = 21412516218937 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21412520413198 and 21412520413207.
It is not a weakly prime, because it can be changed into another prime (21412520415241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10706260206620 + 10706260206621.
It is an arithmetic number, because the mean of its divisors is an integer number (10706260206621).
Almost surely, 221412520413241 is an apocalyptic number.
It is an amenable number.
21412520413241 is a deficient number, since it is larger than the sum of its proper divisors (1).
21412520413241 is an equidigital number, since it uses as much as digits as its factorization.
21412520413241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15360, while the sum is 32.
Adding to 21412520413241 its reverse (14231402521412), we get a palindrome (35643922934653).
The spelling of 21412520413241 in words is "twenty-one trillion, four hundred twelve billion, five hundred twenty million, four hundred thirteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •