Base | Representation |
---|---|
bin | 110000011101010111100001… |
… | …010011101100010000110101 |
3 | 1000221121111012112210102010211 |
4 | 300131113201103230100311 |
5 | 210413312133132333303 |
6 | 2033135550433545421 |
7 | 62614504061522146 |
oct | 6035274123542065 |
9 | 1027544175712124 |
10 | 213124352230453 |
11 | 619a959176a334 |
12 | 1baa0b16415271 |
13 | 91bc703a0a541 |
14 | 3a8b3b8dd3acd |
15 | 1998cc082b66d |
hex | c1d5e14ec435 |
213124352230453 has 2 divisors, whose sum is σ = 213124352230454. Its totient is φ = 213124352230452.
The previous prime is 213124352230441. The next prime is 213124352230511. The reversal of 213124352230453 is 354032253421312.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 198039843911569 + 15084508318884 = 14072663^2 + 3883878^2 .
It is a cyclic number.
It is not a de Polignac number, because 213124352230453 - 237 = 212986913276981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213124350230453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106562176115226 + 106562176115227.
It is an arithmetic number, because the mean of its divisors is an integer number (106562176115227).
Almost surely, 2213124352230453 is an apocalyptic number.
It is an amenable number.
213124352230453 is a deficient number, since it is larger than the sum of its proper divisors (1).
213124352230453 is an equidigital number, since it uses as much as digits as its factorization.
213124352230453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 518400, while the sum is 40.
The spelling of 213124352230453 in words is "two hundred thirteen trillion, one hundred twenty-four billion, three hundred fifty-two million, two hundred thirty thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •