Base | Representation |
---|---|
bin | 11101011011110000001… |
… | …11011110011011100111 |
3 | 10120200102111121010000202 |
4 | 32231320013132123213 |
5 | 113032202112241020 |
6 | 2052333314101115 |
7 | 133031522516441 |
oct | 16557007363347 |
9 | 3520374533022 |
10 | 1011332540135 |
11 | 35a9a3943045 |
12 | 14400527a79b |
13 | 744a30751a8 |
14 | 36d3d55b491 |
15 | 1b4915e0e75 |
hex | eb781de6e7 |
1011332540135 has 8 divisors (see below), whose sum is σ = 1214209829616. Its totient is φ = 808658844480.
The previous prime is 1011332540111. The next prime is 1011332540147. The reversal of 1011332540135 is 5310452331101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1011332540135 - 28 = 1011332539879 is a prime.
It is a super-3 number, since 3×10113325401353 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1011332540098 and 1011332540107.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50887526 + ... + 50907395.
It is an arithmetic number, because the mean of its divisors is an integer number (151776228702).
Almost surely, 21011332540135 is an apocalyptic number.
1011332540135 is a deficient number, since it is larger than the sum of its proper divisors (202877289481).
1011332540135 is a wasteful number, since it uses less digits than its factorization.
1011332540135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101796913.
The product of its (nonzero) digits is 5400, while the sum is 29.
Adding to 1011332540135 its reverse (5310452331101), we get a palindrome (6321784871236).
The spelling of 1011332540135 in words is "one trillion, eleven billion, three hundred thirty-two million, five hundred forty thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •