Base | Representation |
---|---|
bin | 101111111001101011101101… |
… | …0000100000110100100111101 |
3 | 2001020212010010220020210122212 |
4 | 1133303113122010012210331 |
5 | 420211301003233313001 |
6 | 4052042512445150205 |
7 | 154515055116521321 |
oct | 13763273204064475 |
9 | 2036763126223585 |
10 | 421344245213501 |
11 | 112287100001675 |
12 | 3b30b40725b365 |
13 | 15114790357a0c |
14 | 7609255363981 |
15 | 33aa1e64327bb |
hex | 17f35da10693d |
421344245213501 has 2 divisors, whose sum is σ = 421344245213502. Its totient is φ = 421344245213500.
The previous prime is 421344245213473. The next prime is 421344245213513. The reversal of 421344245213501 is 105312542443124.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 414744222172900 + 6600023040601 = 20365270^2 + 2569051^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-421344245213501 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (421344215213501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 210672122606750 + 210672122606751.
It is an arithmetic number, because the mean of its divisors is an integer number (210672122606751).
Almost surely, 2421344245213501 is an apocalyptic number.
It is an amenable number.
421344245213501 is a deficient number, since it is larger than the sum of its proper divisors (1).
421344245213501 is an equidigital number, since it uses as much as digits as its factorization.
421344245213501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 460800, while the sum is 41.
Adding to 421344245213501 its reverse (105312542443124), we get a palindrome (526656787656625).
The spelling of 421344245213501 in words is "four hundred twenty-one trillion, three hundred forty-four billion, two hundred forty-five million, two hundred thirteen thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •