Base | Representation |
---|---|
bin | 111111000001001101… |
… | …1000101110101001111 |
3 | 110221022112021022110010 |
4 | 1332002123011311033 |
5 | 4204130011013111 |
6 | 142100513044303 |
7 | 12530441043204 |
oct | 1760233056517 |
9 | 427275238403 |
10 | 135332126031 |
11 | 52437503363 |
12 | 2228a556693 |
13 | c9b979baab |
14 | 679b703cab |
15 | 37c1022aa6 |
hex | 1f826c5d4f |
135332126031 has 4 divisors (see below), whose sum is σ = 180442834712. Its totient is φ = 90221417352.
The previous prime is 135332126021. The next prime is 135332126047. The reversal of 135332126031 is 130621233531.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 135332126031 - 222 = 135327931727 is a prime.
It is a super-2 number, since 2×1353321260312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 135332126031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135332126021) 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, 22555354336 + ... + 22555354341.
It is an arithmetic number, because the mean of its divisors is an integer number (45110708678).
Almost surely, 2135332126031 is an apocalyptic number.
135332126031 is a deficient number, since it is larger than the sum of its proper divisors (45110708681).
135332126031 is an equidigital number, since it uses as much as digits as its factorization.
135332126031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45110708680.
The product of its (nonzero) digits is 9720, while the sum is 30.
Adding to 135332126031 its reverse (130621233531), we get a palindrome (265953359562).
The spelling of 135332126031 in words is "one hundred thirty-five billion, three hundred thirty-two million, one hundred twenty-six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •