Base | Representation |
---|---|
bin | 1001101001011010001110… |
… | …00111000010101110000011 |
3 | 2210010001010200022212111111 |
4 | 10310231013013002232003 |
5 | 10240032321321102202 |
6 | 113041332133424151 |
7 | 4316443413026305 |
oct | 464550707025603 |
9 | 83101120285444 |
10 | 21214036503427 |
11 | 6839905614989 |
12 | 2467509a9b057 |
13 | bab62391b771 |
14 | 534a9ca41975 |
15 | 26bc5beb56d7 |
hex | 134b471c2b83 |
21214036503427 has 2 divisors, whose sum is σ = 21214036503428. Its totient is φ = 21214036503426.
The previous prime is 21214036503421. The next prime is 21214036503467. The reversal of 21214036503427 is 72430563041212.
It is an a-pointer prime, because the next prime (21214036503467) can be obtained adding 21214036503427 to its sum of digits (40).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 21214036503427 - 23 = 21214036503419 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21214036503427.
It is not a weakly prime, because it can be changed into another prime (21214036503421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10607018251713 + 10607018251714.
It is an arithmetic number, because the mean of its divisors is an integer number (10607018251714).
Almost surely, 221214036503427 is an apocalyptic number.
21214036503427 is a deficient number, since it is larger than the sum of its proper divisors (1).
21214036503427 is an equidigital number, since it uses as much as digits as its factorization.
21214036503427 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 241920, while the sum is 40.
Adding to 21214036503427 its reverse (72430563041212), we get a palindrome (93644599544639).
The spelling of 21214036503427 in words is "twenty-one trillion, two hundred fourteen billion, thirty-six million, five hundred three thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •