Base | Representation |
---|---|
bin | 1001100110001000010101… |
… | …1000101100010000010000 |
3 | 1101100122010212010210100211 |
4 | 2121202011120230100100 |
5 | 2340330241421141144 |
6 | 34234525255253504 |
7 | 2136155424136555 |
oct | 231420530542020 |
9 | 41318125123324 |
10 | 10550677521424 |
11 | 33a8576450427 |
12 | 122496067a294 |
13 | 5b6c03514a61 |
14 | 286926a48a2c |
15 | 1346a9b4d034 |
hex | 9988562c410 |
10550677521424 has 80 divisors (see below), whose sum is σ = 21508853256000. Its totient is φ = 5006262965760.
The previous prime is 10550677521413. The next prime is 10550677521443. The reversal of 10550677521424 is 42412577605501.
It is a super-2 number, since 2×105506775214242 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 182322607 + ... + 182380465.
It is an arithmetic number, because the mean of its divisors is an integer number (268860665700).
Almost surely, 210550677521424 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10550677521424, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10754426628000).
10550677521424 is an abundant number, since it is smaller than the sum of its proper divisors (10958175734576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10550677521424 is a wasteful number, since it uses less digits than its factorization.
10550677521424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64616 (or 64610 counting only the distinct ones).
The product of its (nonzero) digits is 2352000, while the sum is 49.
The spelling of 10550677521424 in words is "ten trillion, five hundred fifty billion, six hundred seventy-seven million, five hundred twenty-one thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •