Base | Representation |
---|---|
bin | 1010001111011… |
… | …00111111011101 |
3 | 12222122110000111 |
4 | 11013230333131 |
5 | 133442432443 |
6 | 12305130021 |
7 | 2062116661 |
oct | 507547735 |
9 | 188573014 |
10 | 85905373 |
11 | 44544a84 |
12 | 24929911 |
13 | 14a4a2a8 |
14 | b5a28a1 |
15 | 781d69d |
hex | 51ecfdd |
85905373 has 4 divisors (see below), whose sum is σ = 88000668. Its totient is φ = 83810080.
The previous prime is 85905367. The next prime is 85905377. The reversal of 85905373 is 37350958.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 37350958 = 2 ⋅18675479.
It can be written as a sum of positive squares in 2 ways, for example, as 50168889 + 35736484 = 7083^2 + 5978^2 .
It is a cyclic number.
It is not a de Polignac number, because 85905373 - 213 = 85897181 is a prime.
It is a super-2 number, since 2×859053732 = 14759466220538258, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (85905377) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1047586 + ... + 1047667.
It is an arithmetic number, because the mean of its divisors is an integer number (22000167).
Almost surely, 285905373 is an apocalyptic number.
It is an amenable number.
85905373 is a deficient number, since it is larger than the sum of its proper divisors (2095295).
85905373 is a wasteful number, since it uses less digits than its factorization.
85905373 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2095294.
The product of its (nonzero) digits is 113400, while the sum is 40.
The square root of 85905373 is about 9268.5151453725. The cubic root of 85905373 is about 441.2385437885.
The spelling of 85905373 in words is "eighty-five million, nine hundred five thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •