Base | Representation |
---|---|
bin | 10101100001100001… |
… | …111001000111011011 |
3 | 2012122122122002101221 |
4 | 111201201321013123 |
5 | 334312421024011 |
6 | 14341143152511 |
7 | 1445500126513 |
oct | 254141710733 |
9 | 65578562357 |
10 | 23111111131 |
11 | 988a68a949 |
12 | 458ba45737 |
13 | 22440c31b4 |
14 | 1193572843 |
15 | 903e5b971 |
hex | 5618791db |
23111111131 has 4 divisors (see below), whose sum is σ = 23293088512. Its totient is φ = 22929133752.
The previous prime is 23111111113. The next prime is 23111111189. The reversal of 23111111131 is 13111111132.
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 23111111131 - 29 = 23111110619 is a prime.
It is a super-2 number, since 2×231111111312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23111111731) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 90988500 + ... + 90988753.
It is an arithmetic number, because the mean of its divisors is an integer number (5823272128).
Almost surely, 223111111131 is an apocalyptic number.
23111111131 is a deficient number, since it is larger than the sum of its proper divisors (181977381).
23111111131 is a wasteful number, since it uses less digits than its factorization.
23111111131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 181977380.
The product of its digits is 18, while the sum is 16.
Adding to 23111111131 its reverse (13111111132), we get a palindrome (36222222263).
Subtracting from 23111111131 its reverse (13111111132), we obtain a palindrome (9999999999).
It can be divided in two parts, 231111 and 11131, that added together give a palindrome (242242).
The spelling of 23111111131 in words is "twenty-three billion, one hundred eleven million, one hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •