Base | Representation |
---|---|
bin | 10100111000011101… |
… | …11111111001010101 |
3 | 1001221022200111111011 |
4 | 22130032333321111 |
5 | 140430021041041 |
6 | 5052245012221 |
7 | 544551610534 |
oct | 123416777125 |
9 | 31838614434 |
10 | 11211112021 |
11 | 483342043a |
12 | 220a6b4071 |
13 | 10988a26c5 |
14 | 784d4631b |
15 | 459390e81 |
hex | 29c3bfe55 |
11211112021 has 8 divisors (see below), whose sum is σ = 11371419864. Its totient is φ = 11050986240.
The previous prime is 11211111997. The next prime is 11211112057. The reversal of 11211112021 is 12021111211.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 2903700996 + 8307411025 = 53886^2 + 91145^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11211112021 - 27 = 11211111893 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11211111992 and 11211112010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11211112061) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 81015 + ... + 170251.
It is an arithmetic number, because the mean of its divisors is an integer number (1421427483).
Almost surely, 211211112021 is an apocalyptic number.
It is an amenable number.
11211112021 is a deficient number, since it is larger than the sum of its proper divisors (160307843).
11211112021 is an equidigital number, since it uses as much as digits as its factorization.
11211112021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91031.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11211112021 its reverse (12021111211), we get a palindrome (23232223232).
The spelling of 11211112021 in words is "eleven billion, two hundred eleven million, one hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •