Base | Representation |
---|---|
bin | 10011011111110000001010… |
… | …101011011010000001101101 |
3 | 102020121010120221111022200121 |
4 | 103133300022223122001231 |
5 | 42214321031444421201 |
6 | 502210355515124541 |
7 | 24026602465404646 |
oct | 2337601253320155 |
9 | 366533527438617 |
10 | 85744906248301 |
11 | 253592352372a3 |
12 | 9749b2b743751 |
13 | 38ac92ca3aa71 |
14 | 172610b6686cd |
15 | 9da64d7d29a1 |
hex | 4dfc0aada06d |
85744906248301 has 16 divisors (see below), whose sum is σ = 86442801052608. Its totient is φ = 85047678518400.
The previous prime is 85744906248293. The next prime is 85744906248401. The reversal of 85744906248301 is 10384260944758.
It is a cyclic number.
It is not a de Polignac number, because 85744906248301 - 23 = 85744906248293 is a prime.
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 85744906248301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (85744906248101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3004678105 + ... + 3004706641.
It is an arithmetic number, because the mean of its divisors is an integer number (5402675065788).
It is a 1-persistent number, because it is pandigital, but 2⋅85744906248301 = 171489812496602 is not.
Almost surely, 285744906248301 is an apocalyptic number.
It is an amenable number.
85744906248301 is a deficient number, since it is larger than the sum of its proper divisors (697894804307).
85744906248301 is a wasteful number, since it uses less digits than its factorization.
85744906248301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39372.
The product of its (nonzero) digits is 46448640, while the sum is 61.
The spelling of 85744906248301 in words is "eighty-five trillion, seven hundred forty-four billion, nine hundred six million, two hundred forty-eight thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.006 sec. • engine limits •