Base | Representation |
---|---|
bin | 1001101100000100100011… |
… | …0100010001100010011100 |
3 | 1101201101120210202012022221 |
4 | 2123001020310101202130 |
5 | 2344013303040310311 |
6 | 34353445040315124 |
7 | 2146430561466121 |
oct | 233011064214234 |
9 | 41641523665287 |
10 | 10652740556956 |
11 | 3437890367673 |
12 | 12406a5312aa4 |
13 | 5c371a56c384 |
14 | 28b849a92748 |
15 | 13718004c671 |
hex | 9b048d1189c |
10652740556956 has 24 divisors (see below), whose sum is σ = 19747861907760. Its totient is φ = 5010778751232.
The previous prime is 10652740556873. The next prime is 10652740556957. The reversal of 10652740556956 is 65965504725601.
It is a super-2 number, since 2×106527405569562 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10652740556894 and 10652740556903.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10652740556957) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35405791 + ... + 35705398.
It is an arithmetic number, because the mean of its divisors is an integer number (822827579490).
Almost surely, 210652740556956 is an apocalyptic number.
It is an amenable number.
10652740556956 is a deficient number, since it is larger than the sum of its proper divisors (9095121350804).
10652740556956 is a wasteful number, since it uses less digits than its factorization.
10652740556956 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71113413 (or 71113411 counting only the distinct ones).
The product of its (nonzero) digits is 68040000, while the sum is 61.
The spelling of 10652740556956 in words is "ten trillion, six hundred fifty-two billion, seven hundred forty million, five hundred fifty-six thousand, nine hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •