Base | Representation |
---|---|
bin | 10100111000011110… |
… | …00100110110001101 |
3 | 1001221022201112022021 |
4 | 22130033010312031 |
5 | 140430022213201 |
6 | 5052245250141 |
7 | 544552023625 |
oct | 123417046615 |
9 | 31838645267 |
10 | 11211132301 |
11 | 48334346a6 |
12 | 220a703951 |
13 | 10988ab9c5 |
14 | 784d4d885 |
15 | 459396ea1 |
hex | 29c3c4d8d |
11211132301 has 24 divisors (see below), whose sum is σ = 11925900000. Its totient is φ = 10526437152.
The previous prime is 11211132287. The next prime is 11211132337. The reversal of 11211132301 is 10323111211.
It is a happy number.
11211132301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11211132301 - 27 = 11211132173 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 (11211132601) 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 23 ways as a sum of consecutive naturals, for example, 22466950 + ... + 22467448.
It is an arithmetic number, because the mean of its divisors is an integer number (496912500).
Almost surely, 211211132301 is an apocalyptic number.
It is an amenable number.
11211132301 is a deficient number, since it is larger than the sum of its proper divisors (714767699).
11211132301 is an equidigital number, since it uses as much as digits as its factorization.
11211132301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1033 (or 990 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 11211132301 its reverse (10323111211), we get a palindrome (21534243512).
The spelling of 11211132301 in words is "eleven billion, two hundred eleven million, one hundred thirty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •