Base | Representation |
---|---|
bin | 110000110110000001… |
… | …1001111101110110001 |
3 | 101000202002210221221002 |
4 | 1201230003033232301 |
5 | 3204304323132142 |
6 | 120104155411345 |
7 | 10402215222422 |
oct | 1415403175661 |
9 | 330662727832 |
10 | 104892005297 |
11 | 40536891092 |
12 | 183b4153b55 |
13 | 9b78188931 |
14 | 5110a4d649 |
15 | 2add95ca32 |
hex | 186c0cfbb1 |
104892005297 has 4 divisors (see below), whose sum is σ = 104893228836. Its totient is φ = 104890781760.
The previous prime is 104892005261. The next prime is 104892005311. The reversal of 104892005297 is 792500298401.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 44396175616 + 60495829681 = 210704^2 + 245959^2 .
It is a cyclic number.
It is not a de Polignac number, because 104892005297 - 26 = 104892005233 is a prime.
It is a super-2 number, since 2×1048920052972 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104892008297) 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, 472628 + ... + 658149.
It is an arithmetic number, because the mean of its divisors is an integer number (26223307209).
Almost surely, 2104892005297 is an apocalyptic number.
It is an amenable number.
104892005297 is a deficient number, since it is larger than the sum of its proper divisors (1223539).
104892005297 is an equidigital number, since it uses as much as digits as its factorization.
104892005297 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1223538.
The product of its (nonzero) digits is 362880, while the sum is 47.
The spelling of 104892005297 in words is "one hundred four billion, eight hundred ninety-two million, five thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •