Base | Representation |
---|---|
bin | 100010001011101100… |
… | …0001111000110111101 |
3 | 21000110211121101011022 |
4 | 1010113120033012331 |
5 | 2200314102021331 |
6 | 53420023433525 |
7 | 5206041266621 |
oct | 1042730170675 |
9 | 230424541138 |
10 | 73406673341 |
11 | 2914a176191 |
12 | 122878b58a5 |
13 | 6bcb168ab1 |
14 | 37a523d181 |
15 | 1d9973567b |
hex | 111760f1bd |
73406673341 has 2 divisors, whose sum is σ = 73406673342. Its totient is φ = 73406673340.
The previous prime is 73406673317. The next prime is 73406673359. The reversal of 73406673341 is 14337660437.
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., 73145366116 + 261307225 = 270454^2 + 16165^2 .
It is an emirp because it is prime and its reverse (14337660437) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 73406673341 - 222 = 73402479037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 73406673292 and 73406673301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (73406673391) 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, 36703336670 + 36703336671.
It is an arithmetic number, because the mean of its divisors is an integer number (36703336671).
Almost surely, 273406673341 is an apocalyptic number.
It is an amenable number.
73406673341 is a deficient number, since it is larger than the sum of its proper divisors (1).
73406673341 is an equidigital number, since it uses as much as digits as its factorization.
73406673341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 762048, while the sum is 44.
The spelling of 73406673341 in words is "seventy-three billion, four hundred six million, six hundred seventy-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •