Base | Representation |
---|---|
bin | 10010101111101111110110… |
… | …11110000110010111011001 |
3 | 12101221212211011000221102112 |
4 | 21113313323132012113121 |
5 | 20400344221122030241 |
6 | 223401332145442105 |
7 | 11453156603340656 |
oct | 1127677336062731 |
9 | 171855734027375 |
10 | 41223020111321 |
11 | 12153648197554 |
12 | 475936a040335 |
13 | 1a004111635c9 |
14 | a272c2048c2d |
15 | 4b748a88b1eb |
hex | 257dfb7865d9 |
41223020111321 has 2 divisors, whose sum is σ = 41223020111322. Its totient is φ = 41223020111320.
The previous prime is 41223020111261. The next prime is 41223020111363. The reversal of 41223020111321 is 12311102032214.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 36223413550921 + 4999606560400 = 6018589^2 + 2235980^2 .
It is a cyclic number.
It is not a de Polignac number, because 41223020111321 - 238 = 40948142204377 is a prime.
It is not a weakly prime, because it can be changed into another prime (41223020113321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20611510055660 + 20611510055661.
It is an arithmetic number, because the mean of its divisors is an integer number (20611510055661).
Almost surely, 241223020111321 is an apocalyptic number.
It is an amenable number.
41223020111321 is a deficient number, since it is larger than the sum of its proper divisors (1).
41223020111321 is an equidigital number, since it uses as much as digits as its factorization.
41223020111321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 41223020111321 its reverse (12311102032214), we get a palindrome (53534122143535).
The spelling of 41223020111321 in words is "forty-one trillion, two hundred twenty-three billion, twenty million, one hundred eleven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •