Base | Representation |
---|---|
bin | 111110011101011010… |
… | …1100101100111101111 |
3 | 110211012211100111111221 |
4 | 1330322311211213233 |
5 | 4144200031044211 |
6 | 141341411124211 |
7 | 12455615433631 |
oct | 1747265454757 |
9 | 424184314457 |
10 | 134131112431 |
11 | 51980575038 |
12 | 21bb42a3667 |
13 | c857a11164 |
14 | 66c5dcca51 |
15 | 3750886c71 |
hex | 1f3ad659ef |
134131112431 has 4 divisors (see below), whose sum is σ = 139962899952. Its totient is φ = 128299324912.
The previous prime is 134131112419. The next prime is 134131112441. The reversal of 134131112431 is 134211131431.
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 134131112431 - 219 = 134130588143 is a prime.
It is a super-2 number, since 2×1341311124312 (a number of 23 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 = 134131112396 and 134131112405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134131112441) 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, 2915893726 + ... + 2915893771.
It is an arithmetic number, because the mean of its divisors is an integer number (34990724988).
Almost surely, 2134131112431 is an apocalyptic number.
134131112431 is a deficient number, since it is larger than the sum of its proper divisors (5831787521).
134131112431 is an equidigital number, since it uses as much as digits as its factorization.
134131112431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5831787520.
The product of its digits is 864, while the sum is 25.
Adding to 134131112431 its reverse (134211131431), we get a palindrome (268342243862).
The spelling of 134131112431 in words is "one hundred thirty-four billion, one hundred thirty-one million, one hundred twelve thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •