Base | Representation |
---|---|
bin | 1001100110001100011011… |
… | …10110100010110100111100 |
3 | 2202201110221222101220110211 |
4 | 10303012031312202310330 |
5 | 10231230034334224012 |
6 | 112514501114442204 |
7 | 4305452514033001 |
oct | 463061566426474 |
9 | 82643858356424 |
10 | 21103554211132 |
11 | 67a6a702024a8 |
12 | 244a015733364 |
13 | ba1097529703 |
14 | 52d5bb7958a8 |
15 | 268e428a16a7 |
hex | 13318dda2d3c |
21103554211132 has 12 divisors (see below), whose sum is σ = 36931934803176. Its totient is φ = 10551572838800.
The previous prime is 21103554211121. The next prime is 21103554211151. The reversal of 21103554211132 is 23111245530112.
It is a super-3 number, since 3×211035542111323 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21103554211094 and 21103554211103.
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 3 ways as a sum of consecutive naturals, for example, 50834119 + ... + 51247582.
It is an arithmetic number, because the mean of its divisors is an integer number (3077661233598).
Almost surely, 221103554211132 is an apocalyptic number.
It is an amenable number.
21103554211132 is a deficient number, since it is larger than the sum of its proper divisors (15828380592044).
21103554211132 is a wasteful number, since it uses less digits than its factorization.
21103554211132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102133388 (or 102133386 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 31.
Adding to 21103554211132 its reverse (23111245530112), we get a palindrome (44214799741244).
The spelling of 21103554211132 in words is "twenty-one trillion, one hundred three billion, five hundred fifty-four million, two hundred eleven thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •