Base | Representation |
---|---|
bin | 101111111100101010101010… |
… | …0011110000110001011001101 |
3 | 2001022022022121202201000010101 |
4 | 1133321111110132012023031 |
5 | 420240010322102203234 |
6 | 4052555132111011101 |
7 | 154556513144142301 |
oct | 13771252436061315 |
9 | 2038268552630111 |
10 | 421754320741069 |
11 | 112425003a44a58 |
12 | 3b376990809a91 |
13 | 15144353208c94 |
14 | 7621037709d01 |
15 | 33b5be7657814 |
hex | 17f95547862cd |
421754320741069 has 2 divisors, whose sum is σ = 421754320741070. Its totient is φ = 421754320741068.
The previous prime is 421754320741043. The next prime is 421754320741093. The reversal of 421754320741069 is 960147023457124.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 327633530422500 + 94120790318569 = 18100650^2 + 9701587^2 .
It is a cyclic number.
It is not a de Polignac number, because 421754320741069 - 25 = 421754320741037 is a prime.
It is a super-2 number, since 2×4217543207410692 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (421754320741099) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 210877160370534 + 210877160370535.
It is an arithmetic number, because the mean of its divisors is an integer number (210877160370535).
Almost surely, 2421754320741069 is an apocalyptic number.
It is an amenable number.
421754320741069 is a deficient number, since it is larger than the sum of its proper divisors (1).
421754320741069 is an equidigital number, since it uses as much as digits as its factorization.
421754320741069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10160640, while the sum is 55.
The spelling of 421754320741069 in words is "four hundred twenty-one trillion, seven hundred fifty-four billion, three hundred twenty million, seven hundred forty-one thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •