Base | Representation |
---|---|
bin | 100110111001010110… |
… | …0010011111001000001 |
3 | 21222121020210101011212 |
4 | 1031302230103321001 |
5 | 2332031310101212 |
6 | 102212243415505 |
7 | 6014626234403 |
oct | 1156254237101 |
9 | 258536711155 |
10 | 83528597057 |
11 | 324737962a4 |
12 | 14231684595 |
13 | 7b521a4979 |
14 | 408565cb73 |
15 | 228d178e22 |
hex | 1372b13e41 |
83528597057 has 4 divisors (see below), whose sum is σ = 83554858836. Its totient is φ = 83502335280.
The previous prime is 83528597017. The next prime is 83528597083. The reversal of 83528597057 is 75079582538.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 28420565056 + 55108032001 = 168584^2 + 234751^2 .
It is a cyclic number.
It is not a de Polignac number, because 83528597057 - 228 = 83260161601 is a prime.
It is a super-2 number, since 2×835285970572 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 83528596987 and 83528597005.
It is not an unprimeable number, because it can be changed into a prime (83528597017) 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, 13126118 + ... + 13132479.
It is an arithmetic number, because the mean of its divisors is an integer number (20888714709).
Almost surely, 283528597057 is an apocalyptic number.
It is an amenable number.
83528597057 is a deficient number, since it is larger than the sum of its proper divisors (26261779).
83528597057 is a wasteful number, since it uses less digits than its factorization.
83528597057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26261778.
The product of its (nonzero) digits is 21168000, while the sum is 59.
The spelling of 83528597057 in words is "eighty-three billion, five hundred twenty-eight million, five hundred ninety-seven thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •