Base | Representation |
---|---|
bin | 10000110111111010010011… |
… | …110000110111011011101001 |
3 | 100201202111100220000220102211 |
4 | 100313322103300313123221 |
5 | 34211332433021013001 |
6 | 421500010002525121 |
7 | 21426363610045444 |
oct | 2067722360673351 |
9 | 321674326026384 |
10 | 74210924001001 |
11 | 21711748a18597 |
12 | 83a66a83667a1 |
13 | 32540a2089a08 |
14 | 1447b83a1265b |
15 | 88a5e2ea1351 |
hex | 437e93c376e9 |
74210924001001 has 12 divisors (see below), whose sum is σ = 77580485377920. Its totient is φ = 70981878605000.
The previous prime is 74210924000933. The next prime is 74210924001029. The reversal of 74210924001001 is 10010042901247.
It is a de Polignac number, because none of the positive numbers 2k-74210924001001 is a prime.
It is a super-3 number, since 3×742109240010013 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (74210924007001) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12769620 + ... + 17648938.
It is an arithmetic number, because the mean of its divisors is an integer number (6465040448160).
Almost surely, 274210924001001 is an apocalyptic number.
It is an amenable number.
74210924001001 is a deficient number, since it is larger than the sum of its proper divisors (3369561376919).
74210924001001 is a wasteful number, since it uses less digits than its factorization.
74210924001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4908116 (or 4908093 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 31.
Adding to 74210924001001 its reverse (10010042901247), we get a palindrome (84220966902248).
The spelling of 74210924001001 in words is "seventy-four trillion, two hundred ten billion, nine hundred twenty-four million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •