Base | Representation |
---|---|
bin | 1001101011100001001101… |
… | …1100101010110110001000 |
3 | 1101200111002202110021112001 |
4 | 2122320103130222312020 |
5 | 2343334341320221440 |
6 | 34345235521200344 |
7 | 2145643533603034 |
oct | 232702334526610 |
9 | 41614082407461 |
10 | 10643255242120 |
11 | 343386312a1a6 |
12 | 123a8987900b4 |
13 | 5c28683a9247 |
14 | 28b1ca0291c4 |
15 | 136cc7458b9a |
hex | 9ae1372ad88 |
10643255242120 has 32 divisors (see below), whose sum is σ = 24171131073600. Its totient is φ = 4217514225088.
The previous prime is 10643255242097. The next prime is 10643255242157. The reversal of 10643255242120 is 2124255234601.
It is a super-2 number, since 2×106432552421202 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10643255242120.
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, 1243366660 + ... + 1243375219.
It is an arithmetic number, because the mean of its divisors is an integer number (755347846050).
Almost surely, 210643255242120 is an apocalyptic number.
10643255242120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10643255242120 is an abundant number, since it is smaller than the sum of its proper divisors (13527875831480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10643255242120 is a wasteful number, since it uses less digits than its factorization.
10643255242120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2486741997 (or 2486741993 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 37.
The spelling of 10643255242120 in words is "ten trillion, six hundred forty-three billion, two hundred fifty-five million, two hundred forty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •