Base | Representation |
---|---|
bin | 100010100111001110… |
… | …0001001111110001001 |
3 | 21002212012211222102102 |
4 | 1011032130021332021 |
5 | 2204212043312003 |
6 | 54051423243145 |
7 | 5240656244522 |
oct | 1051634117611 |
9 | 232765758372 |
10 | 74330447753 |
11 | 29583666611 |
12 | 124a51494b5 |
13 | 7017667883 |
14 | 3851bc7849 |
15 | 1e008ab588 |
hex | 114e709f89 |
74330447753 has 2 divisors, whose sum is σ = 74330447754. Its totient is φ = 74330447752.
The previous prime is 74330447707. The next prime is 74330447761. The reversal of 74330447753 is 35774403347.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 69829648009 + 4500799744 = 264253^2 + 67088^2 .
It is an emirp because it is prime and its reverse (35774403347) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 74330447753 - 28 = 74330447497 is a prime.
It is a super-2 number, since 2×743304477532 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 74330447698 and 74330447707.
It is not a weakly prime, because it can be changed into another prime (74330447353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 37165223876 + 37165223877.
It is an arithmetic number, because the mean of its divisors is an integer number (37165223877).
Almost surely, 274330447753 is an apocalyptic number.
It is an amenable number.
74330447753 is a deficient number, since it is larger than the sum of its proper divisors (1).
74330447753 is an equidigital number, since it uses as much as digits as its factorization.
74330447753 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2963520, while the sum is 47.
The spelling of 74330447753 in words is "seventy-four billion, three hundred thirty million, four hundred forty-seven thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •