Base | Representation |
---|---|
bin | 10100111000011110… |
… | …10101011000010101 |
3 | 1001221022211222012102 |
4 | 22130033111120111 |
5 | 140430031400041 |
6 | 5052250531445 |
7 | 544552425230 |
oct | 123417253025 |
9 | 31838758172 |
10 | 11211200021 |
11 | 483348056a |
12 | 220a736b85 |
13 | 1098903788 |
14 | 784d6a417 |
15 | 4593ac09b |
hex | 29c3d5615 |
11211200021 has 16 divisors (see below), whose sum is σ = 13500556800. Its totient is φ = 9094787568.
The previous prime is 11211200009. The next prime is 11211200027. The reversal of 11211200021 is 12000211211.
11211200021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11211200021 - 230 = 10137458197 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11211199975 and 11211200011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11211200027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 94166 + ... + 176888.
It is an arithmetic number, because the mean of its divisors is an integer number (843784800).
Almost surely, 211211200021 is an apocalyptic number.
It is an amenable number.
11211200021 is a deficient number, since it is larger than the sum of its proper divisors (2289356779).
11211200021 is a wasteful number, since it uses less digits than its factorization.
11211200021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83768.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 11211200021 its reverse (12000211211), we get a palindrome (23211411232).
The spelling of 11211200021 in words is "eleven billion, two hundred eleven million, two hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •