Base | Representation |
---|---|
bin | 100110011111010000… |
… | …101001011101100001 |
3 | 10221200010101012020122 |
4 | 212133100221131201 |
5 | 1134114110202022 |
6 | 30552445250025 |
7 | 2662053463466 |
oct | 463720513541 |
9 | 127603335218 |
10 | 41326647137 |
11 | 165878a6736 |
12 | 8014263915 |
13 | 3b87b8a379 |
14 | 200086766d |
15 | 111d1dc742 |
hex | 99f429761 |
41326647137 has 2 divisors, whose sum is σ = 41326647138. Its totient is φ = 41326647136.
The previous prime is 41326647121. The next prime is 41326647139. The reversal of 41326647137 is 73174662314.
It is a happy number.
41326647137 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., 39597418081 + 1729229056 = 198991^2 + 41584^2 .
It is a cyclic number.
It is not a de Polignac number, because 41326647137 - 24 = 41326647121 is a prime.
It is a super-2 number, since 2×413266471372 (a number of 22 digits) contains 22 as substring.
Together with 41326647139, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (41326647139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20663323568 + 20663323569.
It is an arithmetic number, because the mean of its divisors is an integer number (20663323569).
Almost surely, 241326647137 is an apocalyptic number.
It is an amenable number.
41326647137 is a deficient number, since it is larger than the sum of its proper divisors (1).
41326647137 is an equidigital number, since it uses as much as digits as its factorization.
41326647137 is an evil number, because the sum of its binary digits is even.
The product of its digits is 508032, while the sum is 44.
The spelling of 41326647137 in words is "forty-one billion, three hundred twenty-six million, six hundred forty-seven thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •