Base | Representation |
---|---|
bin | 1001100111010000010100… |
… | …10001001010001110101101 |
3 | 2202211222001001000221002202 |
4 | 10303220022101022032231 |
5 | 10232324210313121141 |
6 | 112543325454231245 |
7 | 4311212640140312 |
oct | 463501221121655 |
9 | 82758031027082 |
10 | 21140001301421 |
11 | 6810473685922 |
12 | 24550a77b5525 |
13 | ba46554a8a22 |
14 | 531278150d09 |
15 | 269d774c949b |
hex | 133a0a44a3ad |
21140001301421 has 2 divisors, whose sum is σ = 21140001301422. Its totient is φ = 21140001301420.
The previous prime is 21140001301403. The next prime is 21140001301427. The reversal of 21140001301421 is 12410310004112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14818950512521 + 6321050788900 = 3849539^2 + 2514170^2 .
It is a cyclic number.
It is not a de Polignac number, because 21140001301421 - 218 = 21140001039277 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21140001301393 and 21140001301402.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21140001301427) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10570000650710 + 10570000650711.
It is an arithmetic number, because the mean of its divisors is an integer number (10570000650711).
Almost surely, 221140001301421 is an apocalyptic number.
It is an amenable number.
21140001301421 is a deficient number, since it is larger than the sum of its proper divisors (1).
21140001301421 is an equidigital number, since it uses as much as digits as its factorization.
21140001301421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 21140001301421 its reverse (12410310004112), we get a palindrome (33550311305533).
The spelling of 21140001301421 in words is "twenty-one trillion, one hundred forty billion, one million, three hundred one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •