Base | Representation |
---|---|
bin | 10111000111100011… |
… | …11001011110111011 |
3 | 1012000222022122012221 |
4 | 23203301321132323 |
5 | 200404312140011 |
6 | 5411324144511 |
7 | 616365345253 |
oct | 134361713673 |
9 | 35028278187 |
10 | 12411443131 |
11 | 5299a32a1a |
12 | 24a4698137 |
13 | 122a4817b9 |
14 | 85a520963 |
15 | 4c9944971 |
hex | 2e3c797bb |
12411443131 has 4 divisors (see below), whose sum is σ = 13064677000. Its totient is φ = 11758209264.
The previous prime is 12411443119. The next prime is 12411443203. The reversal of 12411443131 is 13134411421.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13134411421 = 31 ⋅423690691.
It is a cyclic number.
It is not a de Polignac number, because 12411443131 - 27 = 12411443003 is a prime.
It is a super-2 number, since 2×124114431312 (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 = 12411443096 and 12411443105.
It is not an unprimeable number, because it can be changed into a prime (12411443101) 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, 326616906 + ... + 326616943.
It is an arithmetic number, because the mean of its divisors is an integer number (3266169250).
Almost surely, 212411443131 is an apocalyptic number.
12411443131 is a deficient number, since it is larger than the sum of its proper divisors (653233869).
12411443131 is an equidigital number, since it uses as much as digits as its factorization.
12411443131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 653233868.
The product of its digits is 1152, while the sum is 25.
Adding to 12411443131 its reverse (13134411421), we get a palindrome (25545854552).
The spelling of 12411443131 in words is "twelve billion, four hundred eleven million, four hundred forty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •