Base | Representation |
---|---|
bin | 1001101001011011100010… |
… | …01110110011010101101001 |
3 | 2210010002221221001210101221 |
4 | 10310231301032303111221 |
5 | 10240040243223240044 |
6 | 113041530220142041 |
7 | 4316500053500614 |
oct | 464556116632551 |
9 | 83102857053357 |
10 | 21214743180649 |
11 | 683a138504a47 |
12 | 2467686697921 |
13 | bab707158175 |
14 | 534b2883717b |
15 | 26bc9e056484 |
hex | 134b713b3569 |
21214743180649 has 2 divisors, whose sum is σ = 21214743180650. Its totient is φ = 21214743180648.
The previous prime is 21214743180643. The next prime is 21214743180689. The reversal of 21214743180649 is 94608134741212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20583171249424 + 631571931225 = 4536868^2 + 794715^2 .
It is a cyclic number.
It is not a de Polignac number, because 21214743180649 - 23 = 21214743180641 is a prime.
It is a super-2 number, since 2×212147431806492 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21214743180596 and 21214743180605.
It is not a weakly prime, because it can be changed into another prime (21214743180641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10607371590324 + 10607371590325.
It is an arithmetic number, because the mean of its divisors is an integer number (10607371590325).
Almost surely, 221214743180649 is an apocalyptic number.
It is an amenable number.
21214743180649 is a deficient number, since it is larger than the sum of its proper divisors (1).
21214743180649 is an equidigital number, since it uses as much as digits as its factorization.
21214743180649 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2322432, while the sum is 52.
The spelling of 21214743180649 in words is "twenty-one trillion, two hundred fourteen billion, seven hundred forty-three million, one hundred eighty thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •