Base | Representation |
---|---|
bin | 111111000011010010… |
… | …1101100010101001111 |
3 | 110221111101202222202120 |
4 | 1332012211230111033 |
5 | 4204300403422111 |
6 | 142111451024023 |
7 | 12532250062254 |
oct | 1760645542517 |
9 | 427441688676 |
10 | 135402014031 |
11 | 524729a8239 |
12 | 222a9a3b013 |
13 | c9cb0cb63b |
14 | 67a6ad742b |
15 | 37c722a406 |
hex | 1f8696c54f |
135402014031 has 4 divisors (see below), whose sum is σ = 180536018712. Its totient is φ = 90268009352.
The previous prime is 135402014023. The next prime is 135402014071. The reversal of 135402014031 is 130410204531.
It is a happy number.
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 135402014031 - 23 = 135402014023 is a prime.
It is a super-2 number, since 2×1354020140312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 135402013992 and 135402014010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135402014071) 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, 22567002336 + ... + 22567002341.
It is an arithmetic number, because the mean of its divisors is an integer number (45134004678).
Almost surely, 2135402014031 is an apocalyptic number.
135402014031 is a deficient number, since it is larger than the sum of its proper divisors (45134004681).
135402014031 is an equidigital number, since it uses as much as digits as its factorization.
135402014031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45134004680.
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 135402014031 its reverse (130410204531), we get a palindrome (265812218562).
The spelling of 135402014031 in words is "one hundred thirty-five billion, four hundred two million, fourteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •