Base | Representation |
---|---|
bin | 10010110010101010101011… |
… | …10101000010100011101011 |
3 | 12102022110201020120120200202 |
4 | 21121111111311002203223 |
5 | 20404020130000303113 |
6 | 223515400555222415 |
7 | 11463340254145046 |
oct | 1131252565024353 |
9 | 172273636516622 |
10 | 41323320322283 |
11 | 1219213803058a |
12 | 47748a0447a0b |
13 | 1a09a06c15b6c |
14 | a2c0b8cd5c5d |
15 | 4b9dab127258 |
hex | 259555d428eb |
41323320322283 has 2 divisors, whose sum is σ = 41323320322284. Its totient is φ = 41323320322282.
The previous prime is 41323320322187. The next prime is 41323320322303. The reversal of 41323320322283 is 38222302332314.
41323320322283 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 41323320322283 - 212 = 41323320318187 is a prime.
It is not a weakly prime, because it can be changed into another prime (41320320322283) 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, 20661660161141 + 20661660161142.
It is an arithmetic number, because the mean of its divisors is an integer number (20661660161142).
Almost surely, 241323320322283 is an apocalyptic number.
41323320322283 is a deficient number, since it is larger than the sum of its proper divisors (1).
41323320322283 is an equidigital number, since it uses as much as digits as its factorization.
41323320322283 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 248832, while the sum is 38.
Adding to 41323320322283 its reverse (38222302332314), we get a palindrome (79545622654597).
The spelling of 41323320322283 in words is "forty-one trillion, three hundred twenty-three billion, three hundred twenty million, three hundred twenty-two thousand, two hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •