Base | Representation |
---|---|
bin | 1001100100011000101010… |
… | …01100001111011010001001 |
3 | 2202111112112100212202121112 |
4 | 10302030111030033122021 |
5 | 10224220241440012411 |
6 | 112430141425020105 |
7 | 4301122341441212 |
oct | 462142514173211 |
9 | 82445470782545 |
10 | 21041400313481 |
11 | 6782675a24239 |
12 | 2439b6a484635 |
13 | b98270790192 |
14 | 52a5a2c26409 |
15 | 267505edbb8b |
hex | 13231530f689 |
21041400313481 has 2 divisors, whose sum is σ = 21041400313482. Its totient is φ = 21041400313480.
The previous prime is 21041400313369. The next prime is 21041400313489. The reversal of 21041400313481 is 18431300414012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15287638623481 + 5753761690000 = 3909941^2 + 2398700^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21041400313481 is a prime.
It is a super-2 number, since 2×210414003134812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21041400313489) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10520700156740 + 10520700156741.
It is an arithmetic number, because the mean of its divisors is an integer number (10520700156741).
Almost surely, 221041400313481 is an apocalyptic number.
It is an amenable number.
21041400313481 is a deficient number, since it is larger than the sum of its proper divisors (1).
21041400313481 is an equidigital number, since it uses as much as digits as its factorization.
21041400313481 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9216, while the sum is 32.
Adding to 21041400313481 its reverse (18431300414012), we get a palindrome (39472700727493).
The spelling of 21041400313481 in words is "twenty-one trillion, forty-one billion, four hundred million, three hundred thirteen thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •