Base | Representation |
---|---|
bin | 1001101001010000110110… |
… | …0101011000000010001101 |
3 | 1101112210001222200111111002 |
4 | 2122110031211120002031 |
5 | 2342221010022433110 |
6 | 34315350244110045 |
7 | 2143102310030654 |
oct | 232241545300215 |
9 | 41483058614432 |
10 | 10604502155405 |
11 | 341938700a604 |
12 | 1233282395325 |
13 | 5bc0007655c2 |
14 | 2893912c019b |
15 | 135caa177aa5 |
hex | 9a50d95808d |
10604502155405 has 8 divisors (see below), whose sum is σ = 12742763303832. Its totient is φ = 8472027912768.
The previous prime is 10604502155311. The next prime is 10604502155413. The reversal of 10604502155405 is 50455120540601.
It can be written as a sum of positive squares in 4 ways, for example, as 4824146603236 + 5780355552169 = 2196394^2 + 2404237^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 10604502155405 - 234 = 10587322286221 is a prime.
It is a super-2 number, since 2×106045021554052 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1446722414 + ... + 1446729743.
It is an arithmetic number, because the mean of its divisors is an integer number (1592845412979).
Almost surely, 210604502155405 is an apocalyptic number.
It is an amenable number.
10604502155405 is a deficient number, since it is larger than the sum of its proper divisors (2138261148427).
10604502155405 is an equidigital number, since it uses as much as digits as its factorization.
10604502155405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2893452895.
The product of its (nonzero) digits is 120000, while the sum is 38.
The spelling of 10604502155405 in words is "ten trillion, six hundred four billion, five hundred two million, one hundred fifty-five thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •