Base | Representation |
---|---|
bin | 1100010101111101110… |
… | …11101001011110010101 |
3 | 1111112200221222110211011 |
4 | 12022332323221132111 |
5 | 23422034141234141 |
6 | 522500011212221 |
7 | 42432562250545 |
oct | 6127673513625 |
9 | 1445627873734 |
10 | 424110102421 |
11 | 153956107185 |
12 | 6a241747071 |
13 | 30cbb6a7535 |
14 | 1675429d325 |
15 | b0733d7881 |
hex | 62beee9795 |
424110102421 has 2 divisors, whose sum is σ = 424110102422. Its totient is φ = 424110102420.
The previous prime is 424110102407. The next prime is 424110102467. The reversal of 424110102421 is 124201011424.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 400323209521 + 23786892900 = 632711^2 + 154230^2 .
It is a cyclic number.
It is not a de Polignac number, because 424110102421 - 27 = 424110102293 is a prime.
It is a super-2 number, since 2×4241101024212 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 424110102392 and 424110102401.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (424110102721) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 212055051210 + 212055051211.
It is an arithmetic number, because the mean of its divisors is an integer number (212055051211).
Almost surely, 2424110102421 is an apocalyptic number.
It is an amenable number.
424110102421 is a deficient number, since it is larger than the sum of its proper divisors (1).
424110102421 is an equidigital number, since it uses as much as digits as its factorization.
424110102421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 424110102421 its reverse (124201011424), we get a palindrome (548311113845).
The spelling of 424110102421 in words is "four hundred twenty-four billion, one hundred ten million, one hundred two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •