Base | Representation |
---|---|
bin | 11110110011111100111101… |
… | …001110010011000000010101 |
3 | 122202210202222020110211022111 |
4 | 132303330331032103000111 |
5 | 120230210113310023013 |
6 | 1200113050414431021 |
7 | 40354246203330064 |
oct | 3663747516230025 |
9 | 582722866424274 |
10 | 135511540314133 |
11 | 3a1a6137801a85 |
12 | 13247064802471 |
13 | 5a7c8b6620459 |
14 | 2566b176c61db |
15 | 109ee75b1a73d |
hex | 7b3f3d393015 |
135511540314133 has 8 divisors (see below), whose sum is σ = 138083140067328. Its totient is φ = 132940487903184.
The previous prime is 135511540314127. The next prime is 135511540314193. The reversal of 135511540314133 is 331413045115531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 135511540314133 - 221 = 135511538216981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135511540314193) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 136335685 + ... + 137326042.
It is an arithmetic number, because the mean of its divisors is an integer number (17260392508416).
Almost surely, 2135511540314133 is an apocalyptic number.
It is an amenable number.
135511540314133 is a deficient number, since it is larger than the sum of its proper divisors (2571599753195).
135511540314133 is an equidigital number, since it uses as much as digits as its factorization.
135511540314133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 273671123.
The product of its (nonzero) digits is 162000, while the sum is 40.
Adding to 135511540314133 its reverse (331413045115531), we get a palindrome (466924585429664).
The spelling of 135511540314133 in words is "one hundred thirty-five trillion, five hundred eleven billion, five hundred forty million, three hundred fourteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •