Base | Representation |
---|---|
bin | 100110011101110100… |
… | …001110101001100101 |
3 | 10221121102210022221211 |
4 | 212131310032221211 |
5 | 1134041404420234 |
6 | 30550222111421 |
7 | 2661340530601 |
oct | 463564165145 |
9 | 127542708854 |
10 | 41302420069 |
11 | 16575159569 |
12 | 800811b571 |
13 | 3b82b56c21 |
14 | 1ddb55c501 |
15 | 111b004164 |
hex | 99dd0ea65 |
41302420069 has 2 divisors, whose sum is σ = 41302420070. Its totient is φ = 41302420068.
The previous prime is 41302420031. The next prime is 41302420097. The reversal of 41302420069 is 96002420314.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 37537125025 + 3765295044 = 193745^2 + 61362^2 .
It is a cyclic number.
It is not a de Polignac number, because 41302420069 - 211 = 41302418021 is a prime.
It is a super-2 number, since 2×413024200692 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 41302420069.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41302420769) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20651210034 + 20651210035.
It is an arithmetic number, because the mean of its divisors is an integer number (20651210035).
Almost surely, 241302420069 is an apocalyptic number.
It is an amenable number.
41302420069 is a deficient number, since it is larger than the sum of its proper divisors (1).
41302420069 is an equidigital number, since it uses as much as digits as its factorization.
41302420069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 31.
The spelling of 41302420069 in words is "forty-one billion, three hundred two million, four hundred twenty thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •