Base | Representation |
---|---|
bin | 10000011101110010111000… |
… | …101000001100111011110001 |
3 | 100111101220222201001021112112 |
4 | 100131302320220030323301 |
5 | 33442431433004011131 |
6 | 414003321512135105 |
7 | 21152621042060333 |
oct | 2035627050147361 |
9 | 314356881037475 |
10 | 72416246157041 |
11 | 2108a615082576 |
12 | 8156906397495 |
13 | 3153a9065aa87 |
14 | 13c4d72005453 |
15 | 858aa57d802b |
hex | 41dcb8a0cef1 |
72416246157041 has 2 divisors, whose sum is σ = 72416246157042. Its totient is φ = 72416246157040.
The previous prime is 72416246157037. The next prime is 72416246157103. The reversal of 72416246157041 is 14075164261427.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 53162764038400 + 19253482118641 = 7291280^2 + 4387879^2 .
It is a cyclic number.
It is not a de Polignac number, because 72416246157041 - 22 = 72416246157037 is a prime.
It is a super-2 number, since 2×724162461570412 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (72416246154041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 36208123078520 + 36208123078521.
It is an arithmetic number, because the mean of its divisors is an integer number (36208123078521).
Almost surely, 272416246157041 is an apocalyptic number.
It is an amenable number.
72416246157041 is a deficient number, since it is larger than the sum of its proper divisors (1).
72416246157041 is an equidigital number, since it uses as much as digits as its factorization.
72416246157041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2257920, while the sum is 50.
The spelling of 72416246157041 in words is "seventy-two trillion, four hundred sixteen billion, two hundred forty-six million, one hundred fifty-seven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •