Base | Representation |
---|---|
bin | 101111001000001101101001… |
… | …1100010101000001100000101 |
3 | 2000100210010121220222000021111 |
4 | 1132100123103202220030011 |
5 | 413313402033322423123 |
6 | 4025355234220445021 |
7 | 153213621365426212 |
oct | 13620332342501405 |
9 | 2010703556860244 |
10 | 414545202545413 |
11 | 1100a56a6736125 |
12 | 3a5b17796a9771 |
13 | 14a405a2499654 |
14 | 7452148410b09 |
15 | 32dd41325b90d |
hex | 17906d38a8305 |
414545202545413 has 2 divisors, whose sum is σ = 414545202545414. Its totient is φ = 414545202545412.
The previous prime is 414545202545407. The next prime is 414545202545473. The reversal of 414545202545413 is 314545202545414.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 380459770922884 + 34085431622529 = 19505378^2 + 5838273^2 .
It is a cyclic number.
It is not a de Polignac number, because 414545202545413 - 29 = 414545202544901 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (414545202545473) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 207272601272706 + 207272601272707.
It is an arithmetic number, because the mean of its divisors is an integer number (207272601272707).
Almost surely, 2414545202545413 is an apocalyptic number.
It is an amenable number.
414545202545413 is a deficient number, since it is larger than the sum of its proper divisors (1).
414545202545413 is an equidigital number, since it uses as much as digits as its factorization.
414545202545413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7680000, while the sum is 49.
Subtracting from 414545202545413 its reverse (314545202545414), we obtain a palindrome (99999999999999).
The spelling of 414545202545413 in words is "four hundred fourteen trillion, five hundred forty-five billion, two hundred two million, five hundred forty-five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •