Base | Representation |
---|---|
bin | 1001101011111110011101… |
… | …1001100001101101010000 |
3 | 1101201020100220022222210220 |
4 | 2122333213121201231100 |
5 | 2344001431133432334 |
6 | 34353014533353040 |
7 | 2146342224345624 |
oct | 232774731415520 |
9 | 41636326288726 |
10 | 10651106155344 |
11 | 3437121829536 |
12 | 1240309a98780 |
13 | 5c3519a80025 |
14 | 28b7329a5184 |
15 | 1370d6805449 |
hex | 9afe7661b50 |
10651106155344 has 40 divisors (see below), whose sum is σ = 27518265191520. Its totient is φ = 3549993541248.
The previous prime is 10651106155343. The next prime is 10651106155387. The reversal of 10651106155344 is 44355160115601.
It is a happy number.
It is a super-2 number, since 2×106511061553442 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10651106155296 and 10651106155305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10651106155343) 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, 11265139 + ... + 12173970.
It is an arithmetic number, because the mean of its divisors is an integer number (687956629788).
Almost surely, 210651106155344 is an apocalyptic number.
It is an amenable number.
10651106155344 is an abundant number, since it is smaller than the sum of its proper divisors (16867159036176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10651106155344 is a wasteful number, since it uses less digits than its factorization.
10651106155344 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23448587 (or 23448581 counting only the distinct ones).
The product of its (nonzero) digits is 216000, while the sum is 42.
The spelling of 10651106155344 in words is "ten trillion, six hundred fifty-one billion, one hundred six million, one hundred fifty-five thousand, three hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •