Base | Representation |
---|---|
bin | 1001110010001001000010… |
… | …10100001010111011110001 |
3 | 2211011201112010212202200002 |
4 | 10321010201110022323301 |
5 | 10304441233312341312 |
6 | 113431230154435345 |
7 | 4350224134510445 |
oct | 471044124127361 |
9 | 84151463782602 |
10 | 21514050121457 |
11 | 694506a472653 |
12 | 24b5697a32b55 |
13 | c009c650797a |
14 | 5453dd8ca825 |
15 | 27496a9644c2 |
hex | 13912150aef1 |
21514050121457 has 2 divisors, whose sum is σ = 21514050121458. Its totient is φ = 21514050121456.
The previous prime is 21514050121429. The next prime is 21514050121469. The reversal of 21514050121457 is 75412105041512.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21394473173056 + 119576948401 = 4625416^2 + 345799^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21514050121457 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21514050121457.
It is not a weakly prime, because it can be changed into another prime (21514050121957) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10757025060728 + 10757025060729.
It is an arithmetic number, because the mean of its divisors is an integer number (10757025060729).
Almost surely, 221514050121457 is an apocalyptic number.
It is an amenable number.
21514050121457 is a deficient number, since it is larger than the sum of its proper divisors (1).
21514050121457 is an equidigital number, since it uses as much as digits as its factorization.
21514050121457 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56000, while the sum is 38.
Adding to 21514050121457 its reverse (75412105041512), we get a palindrome (96926155162969).
The spelling of 21514050121457 in words is "twenty-one trillion, five hundred fourteen billion, fifty million, one hundred twenty-one thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •