Base | Representation |
---|---|
bin | 110000010000001001001100… |
… | …0001010101010101101110101 |
3 | 2001122210020011120001010020212 |
4 | 1200200102120022222231311 |
5 | 421112340120101431312 |
6 | 4102405002232235205 |
7 | 155254100216025365 |
oct | 14040223012525565 |
9 | 2048706146033225 |
10 | 424431221123957 |
11 | 1132672a7475183 |
12 | 3b72974523bb05 |
13 | 152a990030c998 |
14 | 76b481b6809a5 |
15 | 341066b7a1822 |
hex | 18204982aab75 |
424431221123957 has 2 divisors, whose sum is σ = 424431221123958. Its totient is φ = 424431221123956.
The previous prime is 424431221123951. The next prime is 424431221123981. The reversal of 424431221123957 is 759321122134424.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 276268743939556 + 148162477184401 = 16621334^2 + 12172201^2 .
It is a cyclic number.
It is not a de Polignac number, because 424431221123957 - 216 = 424431221058421 is a prime.
It is a super-2 number, since 2×4244312211239572 (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 (424431221123951) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 212215610561978 + 212215610561979.
It is an arithmetic number, because the mean of its divisors is an integer number (212215610561979).
Almost surely, 2424431221123957 is an apocalyptic number.
It is an amenable number.
424431221123957 is a deficient number, since it is larger than the sum of its proper divisors (1).
424431221123957 is an equidigital number, since it uses as much as digits as its factorization.
424431221123957 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2903040, while the sum is 50.
The spelling of 424431221123957 in words is "four hundred twenty-four trillion, four hundred thirty-one billion, two hundred twenty-one million, one hundred twenty-three thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •