Base | Representation |
---|---|
bin | 1001101100100101110111… |
… | …0001101001101110010100 |
3 | 1101202020122221212221202021 |
4 | 2123021131301221232110 |
5 | 2344140111111010331 |
6 | 34401524213222524 |
7 | 2150165264535526 |
oct | 233113561515624 |
9 | 41666587787667 |
10 | 10661682125716 |
11 | 3440659679616 |
12 | 124237b931a44 |
13 | 5c4513ba176b |
14 | 28c057417a16 |
15 | 137505036211 |
hex | 9b25dc69b94 |
10661682125716 has 48 divisors (see below), whose sum is σ = 18835994857680. Its totient is φ = 5280150343680.
The previous prime is 10661682125681. The next prime is 10661682125719. The reversal of 10661682125716 is 61752128616601.
It can be written as a sum of positive squares in 8 ways, for example, as 713045136400 + 9948636989316 = 844420^2 + 3154146^2 .
It is a super-2 number, since 2×106616821257162 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10661682125719) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1065204520 + ... + 1065214528.
It is an arithmetic number, because the mean of its divisors is an integer number (392416559535).
Almost surely, 210661682125716 is an apocalyptic number.
It is an amenable number.
10661682125716 is a deficient number, since it is larger than the sum of its proper divisors (8174312731964).
10661682125716 is a wasteful number, since it uses less digits than its factorization.
10661682125716 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14284 (or 14282 counting only the distinct ones).
The product of its (nonzero) digits is 1451520, while the sum is 52.
The spelling of 10661682125716 in words is "ten trillion, six hundred sixty-one billion, six hundred eighty-two million, one hundred twenty-five thousand, seven hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •