Base | Representation |
---|---|
bin | 1001101001011010001110… |
… | …10110000010010111001001 |
3 | 2210010001010221201120101202 |
4 | 10310231013112002113021 |
5 | 10240032323322342441 |
6 | 113041332353553545 |
7 | 4316443461320123 |
oct | 464550726022711 |
9 | 83101127646352 |
10 | 21214040434121 |
11 | 683990785a097 |
12 | 246750b2758b5 |
13 | bab624696912 |
14 | 534a9d386213 |
15 | 26bc5c4e019b |
hex | 134b475825c9 |
21214040434121 has 2 divisors, whose sum is σ = 21214040434122. Its totient is φ = 21214040434120.
The previous prime is 21214040434079. The next prime is 21214040434133. The reversal of 21214040434121 is 12143404041212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20300746753225 + 913293680896 = 4505635^2 + 955664^2 .
It is a cyclic number.
It is not a de Polignac number, because 21214040434121 - 222 = 21214036239817 is a prime.
It is a super-2 number, since 2×212140404341212 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21214040634121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10607020217060 + 10607020217061.
It is an arithmetic number, because the mean of its divisors is an integer number (10607020217061).
Almost surely, 221214040434121 is an apocalyptic number.
It is an amenable number.
21214040434121 is a deficient number, since it is larger than the sum of its proper divisors (1).
21214040434121 is an equidigital number, since it uses as much as digits as its factorization.
21214040434121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6144, while the sum is 29.
Adding to 21214040434121 its reverse (12143404041212), we get a palindrome (33357444475333).
The spelling of 21214040434121 in words is "twenty-one trillion, two hundred fourteen billion, forty million, four hundred thirty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •