Base | Representation |
---|---|
bin | 110000100100100001… |
… | …0000111000011100001 |
3 | 100222020011022212002221 |
4 | 1201021002013003201 |
5 | 3202103423130212 |
6 | 115530011311041 |
7 | 10351522443634 |
oct | 1411102070341 |
9 | 328204285087 |
10 | 104304505057 |
11 | 402651a04a5 |
12 | 1826b44b481 |
13 | 9ab354865c |
14 | 50969dbc1b |
15 | 2aa70ad807 |
hex | 18490870e1 |
104304505057 has 8 divisors (see below), whose sum is σ = 111117613536. Its totient is φ = 97566679872.
The previous prime is 104304505027. The next prime is 104304505111. The reversal of 104304505057 is 750505403401.
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 104304505057 - 219 = 104303980769 is a prime.
It is not an unprimeable number, because it can be changed into a prime (104304505027) 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, 18817963 + ... + 18823504.
It is an arithmetic number, because the mean of its divisors is an integer number (13889701692).
Almost surely, 2104304505057 is an apocalyptic number.
104304505057 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
104304505057 is a deficient number, since it is larger than the sum of its proper divisors (6813108479).
104304505057 is a wasteful number, since it uses less digits than its factorization.
104304505057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37641647.
The product of its (nonzero) digits is 42000, while the sum is 34.
Adding to 104304505057 its reverse (750505403401), we get a palindrome (854809908458).
The spelling of 104304505057 in words is "one hundred four billion, three hundred four million, five hundred five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •