Base | Representation |
---|---|
bin | 11000011011000111… |
… | …11000001111111011 |
3 | 1020211211022111112201 |
4 | 30031203320033323 |
5 | 203323234124011 |
6 | 10005044251031 |
7 | 642636440611 |
oct | 141543701773 |
9 | 36754274481 |
10 | 13112411131 |
11 | 5619683616 |
12 | 265b3a0a77 |
13 | 130c76c671 |
14 | 8c566b6b1 |
15 | 51b258cc1 |
hex | 30d8f83fb |
13112411131 has 4 divisors (see below), whose sum is σ = 13270392072. Its totient is φ = 12954430192.
The previous prime is 13112411101. The next prime is 13112411149. The reversal of 13112411131 is 13111421131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13111421131 = 20143 ⋅650917.
It is a cyclic number.
It is not a de Polignac number, because 13112411131 - 223 = 13104022523 is a prime.
It is a super-2 number, since 2×131124111312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13112411099 and 13112411108.
It is not an unprimeable number, because it can be changed into a prime (13112411101) 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, 78990346 + ... + 78990511.
It is an arithmetic number, because the mean of its divisors is an integer number (3317598018).
Almost surely, 213112411131 is an apocalyptic number.
13112411131 is a deficient number, since it is larger than the sum of its proper divisors (157980941).
13112411131 is an equidigital number, since it uses as much as digits as its factorization.
13112411131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 157980940.
The product of its digits is 72, while the sum is 19.
Adding to 13112411131 its reverse (13111421131), we get a palindrome (26223832262).
The spelling of 13112411131 in words is "thirteen billion, one hundred twelve million, four hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •