Base | Representation |
---|---|
bin | 10010110011110111001000… |
… | …10011010000010010111011 |
3 | 12102110101122201222011020221 |
4 | 21121323210103100102323 |
5 | 20410203210010010321 |
6 | 223550305504000511 |
7 | 11466322350622453 |
oct | 1131734423202273 |
9 | 172411581864227 |
10 | 41364365313211 |
11 | 121a858a941796 |
12 | 4780836300137 |
13 | 1a10848628a45 |
14 | a300901a2d63 |
15 | 4baeae72ae41 |
hex | 259ee44d04bb |
41364365313211 has 2 divisors, whose sum is σ = 41364365313212. Its totient is φ = 41364365313210.
The previous prime is 41364365313163. The next prime is 41364365313241. The reversal of 41364365313211 is 11231356346314.
41364365313211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 41364365313211 - 27 = 41364365313083 is a prime.
It is a super-2 number, since 2×413643653132112 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (41364365313241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20682182656605 + 20682182656606.
It is an arithmetic number, because the mean of its divisors is an integer number (20682182656606).
Almost surely, 241364365313211 is an apocalyptic number.
41364365313211 is a deficient number, since it is larger than the sum of its proper divisors (1).
41364365313211 is an equidigital number, since it uses as much as digits as its factorization.
41364365313211 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 466560, while the sum is 43.
The spelling of 41364365313211 in words is "forty-one trillion, three hundred sixty-four billion, three hundred sixty-five million, three hundred thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •