Base | Representation |
---|---|
bin | 1100010001010011011… |
… | …00101101111100110101 |
3 | 1111022020110210101000112 |
4 | 12020221230231330311 |
5 | 23401422213232123 |
6 | 521403331552405 |
7 | 42313541062325 |
oct | 6105154557465 |
9 | 1438213711015 |
10 | 421606383413 |
11 | 1528908a3016 |
12 | 6986315b705 |
13 | 309aca753b7 |
14 | 16597961285 |
15 | ae786c4d78 |
hex | 6229b2df35 |
421606383413 has 2 divisors, whose sum is σ = 421606383414. Its totient is φ = 421606383412.
The previous prime is 421606383391. The next prime is 421606383431. The reversal of 421606383413 is 314383606124.
Together with next prime (421606383431) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 377515622929 + 44090760484 = 614423^2 + 209978^2 .
It is a cyclic number.
It is not a de Polignac number, because 421606383413 - 26 = 421606383349 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (421606383493) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 210803191706 + 210803191707.
It is an arithmetic number, because the mean of its divisors is an integer number (210803191707).
Almost surely, 2421606383413 is an apocalyptic number.
It is an amenable number.
421606383413 is a deficient number, since it is larger than the sum of its proper divisors (1).
421606383413 is an equidigital number, since it uses as much as digits as its factorization.
421606383413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 248832, while the sum is 41.
Adding to 421606383413 its reverse (314383606124), we get a palindrome (735989989537).
The spelling of 421606383413 in words is "four hundred twenty-one billion, six hundred six million, three hundred eighty-three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •