Base | Representation |
---|---|
bin | 1001100110001011100001… |
… | …0001011000011001100000 |
3 | 1101100201100100120100100022 |
4 | 2121202320101120121200 |
5 | 2340334013444234404 |
6 | 34235150113413012 |
7 | 2136215531511215 |
oct | 231427021303140 |
9 | 41321310510308 |
10 | 10551531243104 |
11 | 33a8974344135 |
12 | 1224b5a56a168 |
13 | 5b700b357007 |
14 | 2869a8199b0c |
15 | 134709a878be |
hex | 998b8458660 |
10551531243104 has 24 divisors (see below), whose sum is σ = 21443434463808. Its totient is φ = 5105579633280.
The previous prime is 10551531243091. The next prime is 10551531243131. The reversal of 10551531243104 is 40134213515501.
It is a happy number.
It is a super-2 number, since 2×105515312431042 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 5318311127 + ... + 5318313110.
It is an arithmetic number, because the mean of its divisors is an integer number (893476435992).
Almost surely, 210551531243104 is an apocalyptic number.
It is an amenable number.
10551531243104 is an abundant number, since it is smaller than the sum of its proper divisors (10891903220704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10551531243104 is a wasteful number, since it uses less digits than its factorization.
10551531243104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10636624278 (or 10636624270 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 35.
Adding to 10551531243104 its reverse (40134213515501), we get a palindrome (50685744758605).
The spelling of 10551531243104 in words is "ten trillion, five hundred fifty-one billion, five hundred thirty-one million, two hundred forty-three thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •