Base | Representation |
---|---|
bin | 110110011010100101… |
… | …001000100101111101 |
3 | 12120210221120222000121 |
4 | 312122211020211331 |
5 | 1424130032010022 |
6 | 42501430454541 |
7 | 4135620545116 |
oct | 663245104575 |
9 | 176727528017 |
10 | 58428000637 |
11 | 228630a0736 |
12 | b3a7504451 |
13 | 5681b79356 |
14 | 2b83bab20d |
15 | 17be7352c7 |
hex | d9a94897d |
58428000637 has 4 divisors (see below), whose sum is σ = 59300060416. Its totient is φ = 57555940860.
The previous prime is 58428000611. The next prime is 58428000721. The reversal of 58428000637 is 73600082485.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 58428000637 - 223 = 58419612029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 58428000593 and 58428000602.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (58428000437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 436029789 + ... + 436029922.
It is an arithmetic number, because the mean of its divisors is an integer number (14825015104).
Almost surely, 258428000637 is an apocalyptic number.
It is an amenable number.
58428000637 is a deficient number, since it is larger than the sum of its proper divisors (872059779).
58428000637 is an equidigital number, since it uses as much as digits as its factorization.
58428000637 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 872059778.
The product of its (nonzero) digits is 322560, while the sum is 43.
The spelling of 58428000637 in words is "fifty-eight billion, four hundred twenty-eight million, six hundred thirty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •