Base | Representation |
---|---|
bin | 1001101011100001001101… |
… | …0101100000111100010110 |
3 | 1101200111002121220222201111 |
4 | 2122320103111200330112 |
5 | 2343334340330212200 |
6 | 34345235413045234 |
7 | 2145643511631640 |
oct | 232702325407426 |
9 | 41614077828644 |
10 | 10643253366550 |
11 | 3433862069042 |
12 | 123a89802681a |
13 | 5c2867ba063c |
14 | 28b1c9a9b890 |
15 | 136cc71d80ba |
hex | 9ae13560f16 |
10643253366550 has 48 divisors (see below), whose sum is σ = 22632629856480. Its totient is φ = 3647806709760.
The previous prime is 10643253366509. The next prime is 10643253366601. The reversal of 10643253366550 is 5566335234601.
It is a super-2 number, since 2×106432533665502 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10643253366494 and 10643253366503.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4475499 + ... + 6427798.
It is an arithmetic number, because the mean of its divisors is an integer number (471513122010).
Almost surely, 210643253366550 is an apocalyptic number.
10643253366550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10643253366550 is an abundant number, since it is smaller than the sum of its proper divisors (11989376489930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10643253366550 is a wasteful number, since it uses less digits than its factorization.
10643253366550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10906105 (or 10906100 counting only the distinct ones).
The product of its (nonzero) digits is 5832000, while the sum is 49.
The spelling of 10643253366550 in words is "ten trillion, six hundred forty-three billion, two hundred fifty-three million, three hundred sixty-six thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •