Base | Representation |
---|---|
bin | 10111101010001010010100… |
… | …010101011100101010000001 |
3 | 111122102022100022120002222121 |
4 | 113222022110111130222001 |
5 | 102114243221242111030 |
6 | 1005144555221404241 |
7 | 30626351431661365 |
oct | 2752122425345201 |
9 | 448368308502877 |
10 | 104052366363265 |
11 | 301773a7199611 |
12 | b806066b69681 |
13 | 460a133020938 |
14 | 1b9a238c672a5 |
15 | c06992c4e47a |
hex | 5ea29455ca81 |
104052366363265 has 4 divisors (see below), whose sum is σ = 124862839635924. Its totient is φ = 83241893090608.
The previous prime is 104052366363199. The next prime is 104052366363269. The reversal of 104052366363265 is 562363663250401.
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 25181839458801 + 78870526904464 = 5018151^2 + 8880908^2 .
It is a cyclic number.
It is not a de Polignac number, because 104052366363265 - 27 = 104052366363137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104052366363269) 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, 10405236636322 + ... + 10405236636331.
It is an arithmetic number, because the mean of its divisors is an integer number (31215709908981).
Almost surely, 2104052366363265 is an apocalyptic number.
It is an amenable number.
104052366363265 is a deficient number, since it is larger than the sum of its proper divisors (20810473272659).
104052366363265 is an equidigital number, since it uses as much as digits as its factorization.
104052366363265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20810473272658.
The product of its (nonzero) digits is 13996800, while the sum is 52.
The spelling of 104052366363265 in words is "one hundred four trillion, fifty-two billion, three hundred sixty-six million, three hundred sixty-three thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •