Base | Representation |
---|---|
bin | 1100001101101100101… |
… | …11111011111000010001 |
3 | 1111010020122001221020012 |
4 | 12012312113323320101 |
5 | 23333441404234401 |
6 | 520443333524305 |
7 | 42214565236034 |
oct | 6066627737021 |
9 | 1433218057205 |
10 | 419671555601 |
11 | 151a8871a271 |
12 | 694031a3695 |
13 | 30761c6927c |
14 | 164529cd01b |
15 | adb38d78bb |
hex | 61b65fbe11 |
419671555601 has 2 divisors, whose sum is σ = 419671555602. Its totient is φ = 419671555600.
The previous prime is 419671555549. The next prime is 419671555603. The reversal of 419671555601 is 106555176914.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 317256195025 + 102415360576 = 563255^2 + 320024^2 .
It is a cyclic number.
It is not a de Polignac number, because 419671555601 - 234 = 402491686417 is a prime.
It is a super-2 number, since 2×4196715556012 (a number of 24 digits) contains 22 as substring.
Together with 419671555603, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 419671555601.
It is not a weakly prime, because it can be changed into another prime (419671555603) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 209835777800 + 209835777801.
It is an arithmetic number, because the mean of its divisors is an integer number (209835777801).
Almost surely, 2419671555601 is an apocalyptic number.
It is an amenable number.
419671555601 is a deficient number, since it is larger than the sum of its proper divisors (1).
419671555601 is an equidigital number, since it uses as much as digits as its factorization.
419671555601 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1134000, while the sum is 50.
The spelling of 419671555601 in words is "four hundred nineteen billion, six hundred seventy-one million, five hundred fifty-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •