Base | Representation |
---|---|
bin | 1010011000010… |
… | …01001101010011 |
3 | 20001211120221011 |
4 | 11030021031103 |
5 | 134242211043 |
6 | 12350111351 |
7 | 2105036002 |
oct | 514111523 |
9 | 201746834 |
10 | 87069523 |
11 | 4516a692 |
12 | 251ab557 |
13 | 15067138 |
14 | b7c6c39 |
15 | 799d59d |
hex | 5309353 |
87069523 has 4 divisors (see below), whose sum is σ = 87197688. Its totient is φ = 86941360.
The previous prime is 87069511. The next prime is 87069553. The reversal of 87069523 is 32596078.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 32596078 = 2 ⋅16298039.
It is a cyclic number.
It is not a de Polignac number, because 87069523 - 217 = 86938451 is a prime.
It is a super-2 number, since 2×870695232 = 15162203670895058, which contains 22 as substring.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (87069503) 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, 63058 + ... + 64423.
It is an arithmetic number, because the mean of its divisors is an integer number (21799422).
Almost surely, 287069523 is an apocalyptic number.
87069523 is a deficient number, since it is larger than the sum of its proper divisors (128165).
87069523 is a wasteful number, since it uses less digits than its factorization.
87069523 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128164.
The product of its (nonzero) digits is 90720, while the sum is 40.
The square root of 87069523 is about 9331.1051328339. The cubic root of 87069523 is about 443.2227612888. Note that the first 3 decimals are identical.
The spelling of 87069523 in words is "eighty-seven million, sixty-nine thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •