Base | Representation |
---|---|
bin | 10011101101010100… |
… | …011000011000100101 |
3 | 2000121202221010011221 |
4 | 103231110120120211 |
5 | 321314310142013 |
6 | 13415454300341 |
7 | 1346254015051 |
oct | 235524303045 |
9 | 60552833157 |
10 | 21161412133 |
11 | 8a7a07a164 |
12 | 4126ab76b1 |
13 | 1cc31ab254 |
14 | 104a64cc61 |
15 | 83cbd308d |
hex | 4ed518625 |
21161412133 has 4 divisors (see below), whose sum is σ = 22406201100. Its totient is φ = 19916623168.
The previous prime is 21161412119. The next prime is 21161412137. The reversal of 21161412133 is 33121416112.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8983627524 + 12177784609 = 94782^2 + 110353^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21161412133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21161412098 and 21161412107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21161412137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 622394458 + ... + 622394491.
It is an arithmetic number, because the mean of its divisors is an integer number (5601550275).
Almost surely, 221161412133 is an apocalyptic number.
It is an amenable number.
21161412133 is a deficient number, since it is larger than the sum of its proper divisors (1244788967).
21161412133 is a wasteful number, since it uses less digits than its factorization.
21161412133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1244788966.
The product of its digits is 864, while the sum is 25.
Adding to 21161412133 its reverse (33121416112), we get a palindrome (54282828245).
The spelling of 21161412133 in words is "twenty-one billion, one hundred sixty-one million, four hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •