Base | Representation |
---|---|
bin | 1001111001010… |
… | …11001100000101 |
3 | 12210012120100121 |
4 | 10330223030011 |
5 | 132222430110 |
6 | 12123141541 |
7 | 2025416335 |
oct | 474531405 |
9 | 183176317 |
10 | 83014405 |
11 | 4294aa51 |
12 | 239748b1 |
13 | 14277466 |
14 | b04d0c5 |
15 | 744bcda |
hex | 4f2b305 |
83014405 has 8 divisors (see below), whose sum is σ = 100046232. Its totient is φ = 66125568.
The previous prime is 83014397. The next prime is 83014409. The reversal of 83014405 is 50441038.
It can be written as a sum of positive squares in 4 ways, for example, as 9449476 + 73564929 = 3074^2 + 8577^2 .
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 83014405 - 23 = 83014397 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 83014405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (83014409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34464 + ... + 36793.
It is an arithmetic number, because the mean of its divisors is an integer number (12505779).
Almost surely, 283014405 is an apocalyptic number.
It is an amenable number.
83014405 is a deficient number, since it is larger than the sum of its proper divisors (17031827).
83014405 is a wasteful number, since it uses less digits than its factorization.
83014405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71495.
The product of its (nonzero) digits is 1920, while the sum is 25.
The square root of 83014405 is about 9111.2241219279. The cubic root of 83014405 is about 436.2323008777.
The spelling of 83014405 in words is "eighty-three million, fourteen thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •