Base | Representation |
---|---|
bin | 10000111000101101110110… |
… | …101101000101111010010001 |
3 | 100201221210020010021011122222 |
4 | 100320231312231011322101 |
5 | 34213234310342003223 |
6 | 421541242014110425 |
7 | 21433363300141502 |
oct | 2070556655057221 |
9 | 321853203234588 |
10 | 74266271047313 |
11 | 2173316a985684 |
12 | 83b5373aab415 |
13 | 3259382848c67 |
14 | 144a714542ba9 |
15 | 88bc81ea10c8 |
hex | 438b76b45e91 |
74266271047313 has 2 divisors, whose sum is σ = 74266271047314. Its totient is φ = 74266271047312.
The previous prime is 74266271047279. The next prime is 74266271047337. The reversal of 74266271047313 is 31374017266247.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 54729101959744 + 19537169087569 = 7397912^2 + 4420087^2 .
It is an emirp because it is prime and its reverse (31374017266247) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 74266271047313 - 236 = 74197551570577 is a prime.
It is a super-2 number, since 2×742662710473132 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (74266271097313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 37133135523656 + 37133135523657.
It is an arithmetic number, because the mean of its divisors is an integer number (37133135523657).
Almost surely, 274266271047313 is an apocalyptic number.
It is an amenable number.
74266271047313 is a deficient number, since it is larger than the sum of its proper divisors (1).
74266271047313 is an equidigital number, since it uses as much as digits as its factorization.
74266271047313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7112448, while the sum is 53.
The spelling of 74266271047313 in words is "seventy-four trillion, two hundred sixty-six billion, two hundred seventy-one million, forty-seven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •