Base | Representation |
---|---|
bin | 10000000011001… |
… | …00111011011011 |
3 | 100101022222012012 |
4 | 20001210323123 |
5 | 233431144011 |
6 | 21205340135 |
7 | 3223226405 |
oct | 1001447333 |
9 | 311288165 |
10 | 134631131 |
11 | 69aa53a8 |
12 | 3910764b |
13 | 21b7a6bb |
14 | 13c47b75 |
15 | bc45a8b |
hex | 8064edb |
134631131 has 4 divisors (see below), whose sum is σ = 141717000. Its totient is φ = 127545264.
The previous prime is 134631113. The next prime is 134631173. The reversal of 134631131 is 131136431.
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 134631131 - 26 = 134631067 is a prime.
It is a super-2 number, since 2×1346311312 = 36251082868678322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 134631097 and 134631106.
It is not an unprimeable number, because it can be changed into a prime (134631181) 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, 3542906 + ... + 3542943.
It is an arithmetic number, because the mean of its divisors is an integer number (35429250).
Almost surely, 2134631131 is an apocalyptic number.
134631131 is a deficient number, since it is larger than the sum of its proper divisors (7085869).
134631131 is an equidigital number, since it uses as much as digits as its factorization.
134631131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7085868.
The product of its digits is 648, while the sum is 23.
The square root of 134631131 is about 11603.0655863009. The cubic root of 134631131 is about 512.5251303164.
Adding to 134631131 its reverse (131136431), we get a palindrome (265767562).
The spelling of 134631131 in words is "one hundred thirty-four million, six hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •