Base | Representation |
---|---|
bin | 100110001100111111… |
… | …101010100100001001 |
3 | 10220212202202100002202 |
4 | 212030333222210021 |
5 | 1133002133032241 |
6 | 30502221205545 |
7 | 2651342664224 |
oct | 461477524411 |
9 | 126782670082 |
10 | 41020205321 |
11 | 1643a922437 |
12 | 7b497008b5 |
13 | 3b39545454 |
14 | 1db1c985bb |
15 | 1101359d9b |
hex | 98cfea909 |
41020205321 has 2 divisors, whose sum is σ = 41020205322. Its totient is φ = 41020205320.
The previous prime is 41020205279. The next prime is 41020205327. The reversal of 41020205321 is 12350202014.
41020205321 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 can be written as a sum of positive squares in only one way, i.e., 37218126400 + 3802078921 = 192920^2 + 61661^2 .
It is a cyclic number.
It is not a de Polignac number, because 41020205321 - 26 = 41020205257 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 41020205293 and 41020205302.
It is not a weakly prime, because it can be changed into another prime (41020205327) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20510102660 + 20510102661.
It is an arithmetic number, because the mean of its divisors is an integer number (20510102661).
Almost surely, 241020205321 is an apocalyptic number.
It is an amenable number.
41020205321 is a deficient number, since it is larger than the sum of its proper divisors (1).
41020205321 is an equidigital number, since it uses as much as digits as its factorization.
41020205321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 480, while the sum is 20.
Adding to 41020205321 its reverse (12350202014), we get a palindrome (53370407335).
The spelling of 41020205321 in words is "forty-one billion, twenty million, two hundred five thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •