Base | Representation |
---|---|
bin | 10011101010110110… |
… | …110010101010101001 |
3 | 2000111220012022000012 |
4 | 103222312302222221 |
5 | 321223221213113 |
6 | 13411421021305 |
7 | 1345242616403 |
oct | 235266625251 |
9 | 60456168005 |
10 | 21120101033 |
11 | 8a58823559 |
12 | 41150b4835 |
13 | 1cb7775a05 |
14 | 1044d77b73 |
15 | 839272aa8 |
hex | 4eadb2aa9 |
21120101033 has 4 divisors (see below), whose sum is σ = 21136114560. Its totient is φ = 21104087508.
The previous prime is 21120100987. The next prime is 21120101071. The reversal of 21120101033 is 33010102112.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21120101033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21120100999 and 21120101017.
It is not an unprimeable number, because it can be changed into a prime (21120101083) 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 3 ways as a sum of consecutive naturals, for example, 8004785 + ... + 8007422.
It is an arithmetic number, because the mean of its divisors is an integer number (5284028640).
Almost surely, 221120101033 is an apocalyptic number.
It is an amenable number.
21120101033 is a deficient number, since it is larger than the sum of its proper divisors (16013527).
21120101033 is a wasteful number, since it uses less digits than its factorization.
21120101033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16013526.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 21120101033 its reverse (33010102112), we get a palindrome (54130203145).
The spelling of 21120101033 in words is "twenty-one billion, one hundred twenty million, one hundred one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •