Base | Representation |
---|---|
bin | 1001100110010001110011… |
… | …1100000000111111111100 |
3 | 1101100212201001112020210011 |
4 | 2121210130330000333330 |
5 | 2340400443324003202 |
6 | 34240025444353004 |
7 | 2136305430064021 |
oct | 231443474007774 |
9 | 41325631466704 |
10 | 10553220141052 |
11 | 33a9660714166 |
12 | 12253500a5764 |
13 | 5b721a217204 |
14 | 286ac85d1548 |
15 | 1347a7e96bd7 |
hex | 9991cf00ffc |
10553220141052 has 36 divisors (see below), whose sum is σ = 19711378379224. Its totient is φ = 4942684535040.
The previous prime is 10553220141047. The next prime is 10553220141097. The reversal of 10553220141052 is 25014102235501.
It is a super-2 number, since 2×105532201410522 (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 (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 21388983 + ... + 21876814.
Almost surely, 210553220141052 is an apocalyptic number.
It is an amenable number.
10553220141052 is a deficient number, since it is larger than the sum of its proper divisors (9158158238172).
10553220141052 is a wasteful number, since it uses less digits than its factorization.
10553220141052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43266046 (or 43266027 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 31.
Adding to 10553220141052 its reverse (25014102235501), we get a palindrome (35567322376553).
The spelling of 10553220141052 in words is "ten trillion, five hundred fifty-three billion, two hundred twenty million, one hundred forty-one thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •