Base | Representation |
---|---|
bin | 100001110011100… |
… | …0100001010010011 |
3 | 2221001102010110111 |
4 | 1003213010022103 |
5 | 4310341023011 |
6 | 304320142151 |
7 | 40052340166 |
oct | 10347041223 |
9 | 2831363414 |
10 | 1134314131 |
11 | 532321aa5 |
12 | 277a67957 |
13 | 1510064c2 |
14 | aa911add |
15 | 698b3121 |
hex | 439c4293 |
1134314131 has 4 divisors (see below), whose sum is σ = 1138500064. Its totient is φ = 1130128200.
The previous prime is 1134314123. The next prime is 1134314141. The reversal of 1134314131 is 1314134311.
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 1134314131 - 23 = 1134314123 is a prime.
It is a super-2 number, since 2×11343141312 = 2573337095572570322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1134314141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2092560 + ... + 2093101.
It is an arithmetic number, because the mean of its divisors is an integer number (284625016).
Almost surely, 21134314131 is an apocalyptic number.
1134314131 is a deficient number, since it is larger than the sum of its proper divisors (4185933).
1134314131 is an equidigital number, since it uses as much as digits as its factorization.
1134314131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4185932.
The product of its digits is 432, while the sum is 22.
The square root of 1134314131 is about 33679.5803269578. The cubic root of 1134314131 is about 1042.9042744991.
Adding to 1134314131 its reverse (1314134311), we get a palindrome (2448448442).
The spelling of 1134314131 in words is "one billion, one hundred thirty-four million, three hundred fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •