Base | Representation |
---|---|
bin | 1001100110001010001011… |
… | …01010100110010100000101 |
3 | 2202201100211120112002221122 |
4 | 10303011011222212110011 |
5 | 10231220044314321013 |
6 | 112514141012523325 |
7 | 4305410506652312 |
oct | 463050552462405 |
9 | 82640746462848 |
10 | 21102343120133 |
11 | 67a64a9610950 |
12 | 2449938020545 |
13 | ba0c33650c12 |
14 | 52d5049b9d09 |
15 | 268dc13c4a08 |
hex | 133145aa6505 |
21102343120133 has 32 divisors (see below), whose sum is σ = 24030558365184. Its totient is φ = 18360322240000.
The previous prime is 21102343120121. The next prime is 21102343120169. The reversal of 21102343120133 is 33102134320112.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 21102343120133 - 28 = 21102343119877 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21102343120193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 180193988 + ... + 180311058.
It is an arithmetic number, because the mean of its divisors is an integer number (750954948912).
Almost surely, 221102343120133 is an apocalyptic number.
It is an amenable number.
21102343120133 is a deficient number, since it is larger than the sum of its proper divisors (2928215245051).
21102343120133 is a wasteful number, since it uses less digits than its factorization.
21102343120133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124717.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 21102343120133 its reverse (33102134320112), we get a palindrome (54204477440245).
The spelling of 21102343120133 in words is "twenty-one trillion, one hundred two billion, three hundred forty-three million, one hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •