Base | Representation |
---|---|
bin | 1000100111000001… |
… | …0000110000010011 |
3 | 12222001210120112021 |
4 | 2021300100300103 |
5 | 14213122131011 |
6 | 1021155312311 |
7 | 111162165502 |
oct | 21160206023 |
9 | 5861716467 |
10 | 2311130131 |
11 | a86633302 |
12 | 545bab697 |
13 | 2aaa7122b |
14 | 17cd28839 |
15 | d7d6e471 |
hex | 89c10c13 |
2311130131 has 4 divisors (see below), whose sum is σ = 2327999832. Its totient is φ = 2294260432.
The previous prime is 2311130099. The next prime is 2311130153. The reversal of 2311130131 is 1310311132.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2311130131 - 25 = 2311130099 is a prime.
It is a super-2 number, since 2×23111301312 = 10682644964832154322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2311130191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8434645 + ... + 8434918.
It is an arithmetic number, because the mean of its divisors is an integer number (581999958).
Almost surely, 22311130131 is an apocalyptic number.
2311130131 is a deficient number, since it is larger than the sum of its proper divisors (16869701).
2311130131 is a wasteful number, since it uses less digits than its factorization.
2311130131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16869700.
The product of its (nonzero) digits is 54, while the sum is 16.
The square root of 2311130131 is about 48074.2148245814. The cubic root of 2311130131 is about 1322.1319487100.
Adding to 2311130131 its reverse (1310311132), we get a palindrome (3621441263).
The spelling of 2311130131 in words is "two billion, three hundred eleven million, one hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •