Base | Representation |
---|---|
bin | 1100000011010100111… |
… | …11001100010110011001 |
3 | 1110120212120122110101011 |
4 | 12001222133030112121 |
5 | 23241040434003421 |
6 | 514123025253521 |
7 | 41626604004316 |
oct | 6015237142631 |
9 | 1416776573334 |
10 | 414103422361 |
11 | 14a69064a362 |
12 | 6830a4942a1 |
13 | 300854bb685 |
14 | 160852bbd0d |
15 | ab89b5a4e1 |
hex | 606a7cc599 |
414103422361 has 2 divisors, whose sum is σ = 414103422362. Its totient is φ = 414103422360.
The previous prime is 414103422347. The next prime is 414103422371. The reversal of 414103422361 is 163224301414.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 401361527961 + 12741894400 = 633531^2 + 112880^2 .
It is a cyclic number.
It is not a de Polignac number, because 414103422361 - 213 = 414103414169 is a prime.
It is a super-2 number, since 2×4141034223612 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (414103422371) 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, 207051711180 + 207051711181.
It is an arithmetic number, because the mean of its divisors is an integer number (207051711181).
Almost surely, 2414103422361 is an apocalyptic number.
It is an amenable number.
414103422361 is a deficient number, since it is larger than the sum of its proper divisors (1).
414103422361 is an equidigital number, since it uses as much as digits as its factorization.
414103422361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 414103422361 its reverse (163224301414), we get a palindrome (577327723775).
The spelling of 414103422361 in words is "four hundred fourteen billion, one hundred three million, four hundred twenty-two thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •