Base | Representation |
---|---|
bin | 110000100010111000101101… |
… | …101010111011111111000101 |
3 | 1000222221202002022112100012201 |
4 | 300202320231222323333011 |
5 | 210441020323132432004 |
6 | 2034030110114314501 |
7 | 62654061001663342 |
oct | 6042705552737705 |
9 | 1028852068470181 |
10 | 213503590514629 |
11 | 620354009002a8 |
12 | 1bb42514588a31 |
13 | 92193c0c0391c |
14 | 3aa18b3a6d7c9 |
15 | 19a3ab96956a4 |
hex | c22e2dabbfc5 |
213503590514629 has 2 divisors, whose sum is σ = 213503590514630. Its totient is φ = 213503590514628.
The previous prime is 213503590514611. The next prime is 213503590514663. The reversal of 213503590514629 is 926415095305312.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 207319739554404 + 6183850960225 = 14398602^2 + 2486735^2 .
It is a cyclic number.
It is not a de Polignac number, because 213503590514629 - 25 = 213503590514597 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 213503590514629.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213513590514629) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106751795257314 + 106751795257315.
It is an arithmetic number, because the mean of its divisors is an integer number (106751795257315).
Almost surely, 2213503590514629 is an apocalyptic number.
It is an amenable number.
213503590514629 is a deficient number, since it is larger than the sum of its proper divisors (1).
213503590514629 is an equidigital number, since it uses as much as digits as its factorization.
213503590514629 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8748000, while the sum is 55.
The spelling of 213503590514629 in words is "two hundred thirteen trillion, five hundred three billion, five hundred ninety million, five hundred fourteen thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •