Base | Representation |
---|---|
bin | 10100111000100101… |
… | …11000011101010011 |
3 | 1001221101121020001221 |
4 | 22130102320131103 |
5 | 140430301131011 |
6 | 5052322505511 |
7 | 544563351016 |
oct | 123422703523 |
9 | 31841536057 |
10 | 11212130131 |
11 | 4833a56354 |
12 | 220ab05297 |
13 | 1098b6ac37 |
14 | 78512d37d |
15 | 4594e2971 |
hex | 29c4b8753 |
11212130131 has 2 divisors, whose sum is σ = 11212130132. Its totient is φ = 11212130130.
The previous prime is 11212130129. The next prime is 11212130161. The reversal of 11212130131 is 13103121211.
It is a happy number.
11212130131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11212130131 - 21 = 11212130129 is a prime.
It is a super-2 number, since 2×112121301312 (a number of 21 digits) contains 22 as substring.
Together with 11212130129, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (11212130161) 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 as a sum of consecutive naturals, namely, 5606065065 + 5606065066.
It is an arithmetic number, because the mean of its divisors is an integer number (5606065066).
Almost surely, 211212130131 is an apocalyptic number.
11212130131 is a deficient number, since it is larger than the sum of its proper divisors (1).
11212130131 is an equidigital number, since it uses as much as digits as its factorization.
11212130131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 11212130131 its reverse (13103121211), we get a palindrome (24315251342).
The spelling of 11212130131 in words is "eleven billion, two hundred twelve million, one hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •