Base | Representation |
---|---|
bin | 110110010011010110… |
… | …100001001011010101 |
3 | 12120111111101201010221 |
4 | 312103112201023111 |
5 | 1423403010304121 |
6 | 42441415314341 |
7 | 4132616005366 |
oct | 662326411325 |
9 | 176444351127 |
10 | 58306728661 |
11 | 228006a0265 |
12 | b37297b9b1 |
13 | 56629c849c |
14 | 2b71a3db6d |
15 | 17b3c7cb41 |
hex | d935a12d5 |
58306728661 has 4 divisors (see below), whose sum is σ = 58313467872. Its totient is φ = 58299989452.
The previous prime is 58306728659. The next prime is 58306728713. The reversal of 58306728661 is 16682760385.
58306728661 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 58306728661 - 21 = 58306728659 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 58306728599 and 58306728608.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (58306726661) 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, 3356611 + ... + 3373936.
It is an arithmetic number, because the mean of its divisors is an integer number (14578366968).
Almost surely, 258306728661 is an apocalyptic number.
It is an amenable number.
58306728661 is a deficient number, since it is larger than the sum of its proper divisors (6739211).
58306728661 is an equidigital number, since it uses as much as digits as its factorization.
58306728661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6739210.
The product of its (nonzero) digits is 2903040, while the sum is 52.
The spelling of 58306728661 in words is "fifty-eight billion, three hundred six million, seven hundred twenty-eight thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •