Base | Representation |
---|---|
bin | 110000000001010010100111… |
… | …1000000000110111001001101 |
3 | 2001101120002010021101121000001 |
4 | 1200002211033000012321031 |
5 | 420330413440320402141 |
6 | 4054203122312404301 |
7 | 154653443043046252 |
oct | 14002451700067115 |
9 | 2041502107347001 |
10 | 422389884153421 |
11 | 11264a5a8a17628 |
12 | 3b459ba56a6691 |
13 | 1518c26ca15442 |
14 | 7643acac3b429 |
15 | 33c74e4747a31 |
hex | 180294f006e4d |
422389884153421 has 2 divisors, whose sum is σ = 422389884153422. Its totient is φ = 422389884153420.
The previous prime is 422389884153329. The next prime is 422389884153439. The reversal of 422389884153421 is 124351488983224.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 308054660808196 + 114335223345225 = 17551486^2 + 10692765^2 .
It is a cyclic number.
It is not a de Polignac number, because 422389884153421 - 29 = 422389884152909 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (422389884153491) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 211194942076710 + 211194942076711.
It is an arithmetic number, because the mean of its divisors is an integer number (211194942076711).
Almost surely, 2422389884153421 is an apocalyptic number.
It is an amenable number.
422389884153421 is a deficient number, since it is larger than the sum of its proper divisors (1).
422389884153421 is an equidigital number, since it uses as much as digits as its factorization.
422389884153421 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 106168320, while the sum is 64.
The spelling of 422389884153421 in words is "four hundred twenty-two trillion, three hundred eighty-nine billion, eight hundred eighty-four million, one hundred fifty-three thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •