Base | Representation |
---|---|
bin | 10011011111111011000100… |
… | …111100011100110110000010 |
3 | 102020122020211101021012012012 |
4 | 103133323010330130312002 |
5 | 42220014030012304213 |
6 | 502220014203332522 |
7 | 24030466006100105 |
oct | 2337730474346602 |
9 | 366566741235165 |
10 | 85756621213058 |
11 | 253631a7005754 |
12 | 975025ab21142 |
13 | 38b0a78b14083 |
14 | 17268dd48a73c |
15 | 9daad6eed4a8 |
hex | 4dfec4f1cd82 |
85756621213058 has 8 divisors (see below), whose sum is σ = 128636190378828. Its totient is φ = 42877891086784.
The previous prime is 85756621213037. The next prime is 85756621213069. The reversal of 85756621213058 is 85031212665758.
85756621213058 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 78701791188409 + 7054830024649 = 8871403^2 + 2656093^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×857566212130583 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 85756621212988 and 85756621213006.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 209504291 + ... + 209913222.
Almost surely, 285756621213058 is an apocalyptic number.
85756621213058 is a deficient number, since it is larger than the sum of its proper divisors (42879569165770).
85756621213058 is a wasteful number, since it uses less digits than its factorization.
85756621213058 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 419519748.
The product of its (nonzero) digits is 24192000, while the sum is 59.
The spelling of 85756621213058 in words is "eighty-five trillion, seven hundred fifty-six billion, six hundred twenty-one million, two hundred thirteen thousand, fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •