Base | Representation |
---|---|
bin | 10000110101011011010011… |
… | …011011110101000011111011 |
3 | 100201011011200101112200001112 |
4 | 100311123103123311003323 |
5 | 34201033304021130001 |
6 | 421245332332310535 |
7 | 21411141006043445 |
oct | 2065332333650373 |
9 | 321134611480045 |
10 | 74040193536251 |
11 | 216562a7033448 |
12 | 837959b01244b |
13 | 3240c639b7b87 |
14 | 143d7c8d51495 |
15 | 885e4e466cbb |
hex | 4356d36f50fb |
74040193536251 has 8 divisors (see below), whose sum is σ = 74045568214800. Its totient is φ = 74034819113472.
The previous prime is 74040193536217. The next prime is 74040193536389. The reversal of 74040193536251 is 15263539104047.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 74040193536251 - 238 = 73765315629307 is a prime.
It is a super-2 number, since 2×740401935362512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 74040193536251.
It is not an unprimeable number, because it can be changed into a prime (74040193532251) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1472737451 + ... + 1472787723.
It is an arithmetic number, because the mean of its divisors is an integer number (9255696026850).
Almost surely, 274040193536251 is an apocalyptic number.
74040193536251 is a deficient number, since it is larger than the sum of its proper divisors (5374678549).
74040193536251 is a wasteful number, since it uses less digits than its factorization.
74040193536251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127885.
The product of its (nonzero) digits is 2721600, while the sum is 50.
The spelling of 74040193536251 in words is "seventy-four trillion, forty billion, one hundred ninety-three million, five hundred thirty-six thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •