Base | Representation |
---|---|
bin | 100010011110100100… |
… | …0011100001010110101 |
3 | 21002002222110002120010 |
4 | 1010331020130022311 |
5 | 2203113224113431 |
6 | 54002531330433 |
7 | 5230532116614 |
oct | 1047510341265 |
9 | 232088402503 |
10 | 74040066741 |
11 | 29444762003 |
12 | 12423a50a19 |
13 | 6c9c4570a4 |
14 | 38253d987b |
15 | 1dd514c846 |
hex | 113d21c2b5 |
74040066741 has 16 divisors (see below), whose sum is σ = 100331538944. Its totient is φ = 48556349424.
The previous prime is 74040066739. The next prime is 74040066757. The reversal of 74040066741 is 14766004047.
It is a happy number.
It is not a de Polignac number, because 74040066741 - 21 = 74040066739 is a prime.
It is a super-3 number, since 3×740400667413 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 74040066741.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (74040066241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 107215 + ... + 399468.
It is an arithmetic number, because the mean of its divisors is an integer number (6270721184).
Almost surely, 274040066741 is an apocalyptic number.
It is an amenable number.
74040066741 is a deficient number, since it is larger than the sum of its proper divisors (26291472203).
74040066741 is a wasteful number, since it uses less digits than its factorization.
74040066741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 507480.
The product of its (nonzero) digits is 112896, while the sum is 39.
The spelling of 74040066741 in words is "seventy-four billion, forty million, sixty-six thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •