Base | Representation |
---|---|
bin | 1011111111101010111… |
… | …10010011000110000101 |
3 | 1110101210202121011002001 |
4 | 11333311132103012011 |
5 | 23223030401103243 |
6 | 513200135545301 |
7 | 41530135232206 |
oct | 5776536230605 |
9 | 1411722534061 |
10 | 412140253573 |
11 | 149873479614 |
12 | 67a60b2b231 |
13 | 2cb3186b739 |
14 | 15d3a68d5ad |
15 | aac2620a4d |
hex | 5ff5793185 |
412140253573 has 2 divisors, whose sum is σ = 412140253574. Its totient is φ = 412140253572.
The previous prime is 412140253571. The next prime is 412140253583. The reversal of 412140253573 is 375352041214.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 215502993729 + 196637259844 = 464223^2 + 443438^2 .
It is a cyclic number.
It is not a de Polignac number, because 412140253573 - 21 = 412140253571 is a prime.
Together with 412140253571, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (412140253571) 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, 206070126786 + 206070126787.
It is an arithmetic number, because the mean of its divisors is an integer number (206070126787).
Almost surely, 2412140253573 is an apocalyptic number.
It is an amenable number.
412140253573 is a deficient number, since it is larger than the sum of its proper divisors (1).
412140253573 is an equidigital number, since it uses as much as digits as its factorization.
412140253573 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 100800, while the sum is 37.
Adding to 412140253573 its reverse (375352041214), we get a palindrome (787492294787).
The spelling of 412140253573 in words is "four hundred twelve billion, one hundred forty million, two hundred fifty-three thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •