Base | Representation |
---|---|
bin | 1001101100100101100100… |
… | …0011111010000101110001 |
3 | 1101202020110110001020022221 |
4 | 2123021121003322011301 |
5 | 2344134430333302030 |
6 | 34401512310001041 |
7 | 2150163314310133 |
oct | 233113103720561 |
9 | 41666413036287 |
10 | 10661603025265 |
11 | 3440618a62245 |
12 | 1242359346181 |
13 | 5c450069796a |
14 | 28c04ab07053 |
15 | 1374ed10de7a |
hex | 9b2590fa171 |
10661603025265 has 8 divisors (see below), whose sum is σ = 12806308848168. Its totient is φ = 8521025608320.
The previous prime is 10661603025263. The next prime is 10661603025277. The reversal of 10661603025265 is 56252030616601.
It can be written as a sum of positive squares in 4 ways, for example, as 4465745259361 + 6195857765904 = 2113231^2 + 2489148^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10661603025265 - 21 = 10661603025263 is a prime.
It is a super-2 number, since 2×106616030252652 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10661603025263) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1032095806 + ... + 1032106135.
It is an arithmetic number, because the mean of its divisors is an integer number (1600788606021).
Almost surely, 210661603025265 is an apocalyptic number.
It is an amenable number.
10661603025265 is a deficient number, since it is larger than the sum of its proper divisors (2144705822903).
10661603025265 is a wasteful number, since it uses less digits than its factorization.
10661603025265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2064202979.
The product of its (nonzero) digits is 388800, while the sum is 43.
The spelling of 10661603025265 in words is "ten trillion, six hundred sixty-one billion, six hundred three million, twenty-five thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •