Base | Representation |
---|---|
bin | 101011101001010100… |
… | …1101110000010100001 |
3 | 22221221002122100122202 |
4 | 1113102221232002201 |
5 | 3013423441340212 |
6 | 111020330142545 |
7 | 6525451544033 |
oct | 1272251560241 |
9 | 287832570582 |
10 | 93728465057 |
11 | 36828303077 |
12 | 161b9581a55 |
13 | 8ab9401316 |
14 | 477216bc53 |
15 | 26888670c2 |
hex | 15d2a6e0a1 |
93728465057 has 8 divisors (see below), whose sum is σ = 99297040392. Its totient is φ = 88166016000.
The previous prime is 93728465027. The next prime is 93728465081. The reversal of 93728465057 is 75056482739.
It can be written as a sum of positive squares in 4 ways, for example, as 10267566241 + 83460898816 = 101329^2 + 288896^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 93728465057 - 220 = 93727416481 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 93728464993 and 93728465011.
It is not an unprimeable number, because it can be changed into a prime (93728465027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1500044 + ... + 1561277.
It is an arithmetic number, because the mean of its divisors is an integer number (12412130049).
Almost surely, 293728465057 is an apocalyptic number.
It is an amenable number.
93728465057 is a deficient number, since it is larger than the sum of its proper divisors (5568575335).
93728465057 is a wasteful number, since it uses less digits than its factorization.
93728465057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3063139.
The product of its (nonzero) digits is 12700800, while the sum is 56.
The spelling of 93728465057 in words is "ninety-three billion, seven hundred twenty-eight million, four hundred sixty-five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •