Base | Representation |
---|---|
bin | 1100010001110000000… |
… | …10000111000111111001 |
3 | 1111022212020022111010022 |
4 | 12020320002013013321 |
5 | 23402420244410234 |
6 | 521443242300225 |
7 | 42322521153023 |
oct | 6107002070771 |
9 | 1438766274108 |
10 | 421846872569 |
11 | 1529a4620091 |
12 | 6990b7b7675 |
13 | 30a1a837a85 |
14 | 165bb883013 |
15 | ae8e87ae2e |
hex | 62380871f9 |
421846872569 has 2 divisors, whose sum is σ = 421846872570. Its totient is φ = 421846872568.
The previous prime is 421846872547. The next prime is 421846872571. The reversal of 421846872569 is 965278648124.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 379748040169 + 42098832400 = 616237^2 + 205180^2 .
It is a cyclic number.
It is not a de Polignac number, because 421846872569 - 212 = 421846868473 is a prime.
It is a super-2 number, since 2×4218468725692 (a number of 24 digits) contains 22 as substring.
Together with 421846872571, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (421846872539) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 210923436284 + 210923436285.
It is an arithmetic number, because the mean of its divisors is an integer number (210923436285).
Almost surely, 2421846872569 is an apocalyptic number.
It is an amenable number.
421846872569 is a deficient number, since it is larger than the sum of its proper divisors (1).
421846872569 is an equidigital number, since it uses as much as digits as its factorization.
421846872569 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 46448640, while the sum is 62.
The spelling of 421846872569 in words is "four hundred twenty-one billion, eight hundred forty-six million, eight hundred seventy-two thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •