Base | Representation |
---|---|
bin | 10000111110100111000110… |
… | …101111001111110000101111 |
3 | 100210101111210010022100101201 |
4 | 100332213012233033300233 |
5 | 34241403401210340210 |
6 | 422451312414550331 |
7 | 21504553301411110 |
oct | 2076470657176057 |
9 | 323344703270351 |
10 | 74671340715055 |
11 | 21879a35179427 |
12 | 845b980b083a7 |
13 | 32886285993a6 |
14 | 146217db40207 |
15 | 89758d9b353a |
hex | 43e9c6bcfc2f |
74671340715055 has 8 divisors (see below), whose sum is σ = 102406410123552. Its totient is φ = 51203205061728.
The previous prime is 74671340714987. The next prime is 74671340715077. The reversal of 74671340715055 is 55051704317647.
It is a happy number.
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 74671340715055 - 211 = 74671340713007 is a prime.
It is a super-3 number, since 3×746713407150553 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 74671340714987 and 74671340715005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1066733438752 + ... + 1066733438821.
It is an arithmetic number, because the mean of its divisors is an integer number (12800801265444).
Almost surely, 274671340715055 is an apocalyptic number.
74671340715055 is a deficient number, since it is larger than the sum of its proper divisors (27735069408497).
74671340715055 is a wasteful number, since it uses less digits than its factorization.
74671340715055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2133466877585.
The product of its (nonzero) digits is 12348000, while the sum is 55.
The spelling of 74671340715055 in words is "seventy-four trillion, six hundred seventy-one billion, three hundred forty million, seven hundred fifteen thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •