Base | Representation |
---|---|
bin | 100110011101110111… |
… | …100110001101110101 |
3 | 10221121111110012011001 |
4 | 212131313212031311 |
5 | 1134042121144104 |
6 | 30550253043301 |
7 | 2661351166042 |
oct | 463567461565 |
9 | 127544405131 |
10 | 41303303029 |
11 | 1657570198a |
12 | 8008486531 |
13 | 3b830a5aa1 |
14 | 1ddb70c1c9 |
15 | 111b12aaa4 |
hex | 99dde6375 |
41303303029 has 2 divisors, whose sum is σ = 41303303030. Its totient is φ = 41303303028.
The previous prime is 41303302987. The next prime is 41303303057. The reversal of 41303303029 is 92030330314.
It is an a-pointer prime, because the next prime (41303303057) can be obtained adding 41303303029 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 36058212100 + 5245090929 = 189890^2 + 72423^2 .
It is a cyclic number.
It is not a de Polignac number, because 41303303029 - 227 = 41169085301 is a prime.
It is a super-2 number, since 2×413033030292 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 41303302988 and 41303303006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41303301029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20651651514 + 20651651515.
It is an arithmetic number, because the mean of its divisors is an integer number (20651651515).
Almost surely, 241303303029 is an apocalyptic number.
It is an amenable number.
41303303029 is a deficient number, since it is larger than the sum of its proper divisors (1).
41303303029 is an equidigital number, since it uses as much as digits as its factorization.
41303303029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5832, while the sum is 28.
The spelling of 41303303029 in words is "forty-one billion, three hundred three million, three hundred three thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •