Base | Representation |
---|---|
bin | 10011011111100101001110… |
… | …011110001110011000011011 |
3 | 102020120000021020111010221021 |
4 | 103133211032132032120123 |
5 | 42214123002114212111 |
6 | 502201134105223311 |
7 | 24026005411266040 |
oct | 2337451636163033 |
9 | 366500236433837 |
10 | 85733158741531 |
11 | 25354257061614 |
12 | 97477b1491b37 |
13 | 38ab7a9cac722 |
14 | 17257153b51c7 |
15 | 9da1b22d9d71 |
hex | 4df94e78e61b |
85733158741531 has 8 divisors (see below), whose sum is σ = 97980986849760. Its totient is φ = 73485389133888.
The previous prime is 85733158741513. The next prime is 85733158741537. The reversal of 85733158741531 is 13514785133758.
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 85733158741531 - 27 = 85733158741403 is a prime.
It is a super-2 number, since 2×857331587415312 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 85733158741531.
It is not an unprimeable number, because it can be changed into a prime (85733158741537) 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, 11438476 + ... + 17386921.
It is an arithmetic number, because the mean of its divisors is an integer number (12247623356220).
Almost surely, 285733158741531 is an apocalyptic number.
85733158741531 is a deficient number, since it is larger than the sum of its proper divisors (12247828108229).
85733158741531 is a wasteful number, since it uses less digits than its factorization.
85733158741531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29250293.
The product of its digits is 42336000, while the sum is 61.
The spelling of 85733158741531 in words is "eighty-five trillion, seven hundred thirty-three billion, one hundred fifty-eight million, seven hundred forty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •