Base | Representation |
---|---|
bin | 1100000011011000001… |
… | …01010111001100111101 |
3 | 1110120221110001011221022 |
4 | 12001230011113030331 |
5 | 23241114313034001 |
6 | 514125423313525 |
7 | 41630350444265 |
oct | 6015405271475 |
9 | 1416843034838 |
10 | 414130205501 |
11 | 14a6a4782991 |
12 | 6831744b8a5 |
13 | 3008ac0839c |
14 | 16088a907a5 |
15 | ab8c19b11b |
hex | 606c15733d |
414130205501 has 2 divisors, whose sum is σ = 414130205502. Its totient is φ = 414130205500.
The previous prime is 414130205399. The next prime is 414130205519. The reversal of 414130205501 is 105502031414.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 379981013476 + 34149192025 = 616426^2 + 184795^2 .
It is a cyclic number.
It is not a de Polignac number, because 414130205501 - 234 = 396950336317 is a prime.
It is a super-2 number, since 2×4141302055012 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (414130205581) 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, 207065102750 + 207065102751.
It is an arithmetic number, because the mean of its divisors is an integer number (207065102751).
Almost surely, 2414130205501 is an apocalyptic number.
It is an amenable number.
414130205501 is a deficient number, since it is larger than the sum of its proper divisors (1).
414130205501 is an equidigital number, since it uses as much as digits as its factorization.
414130205501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 414130205501 its reverse (105502031414), we get a palindrome (519632236915).
The spelling of 414130205501 in words is "four hundred fourteen billion, one hundred thirty million, two hundred five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •