Base | Representation |
---|---|
bin | 11110101100101100111001… |
… | …100010100011110010000011 |
3 | 122201001010211101111121001100 |
4 | 132230230321202203302003 |
5 | 120144024130122414111 |
6 | 1155052123023505443 |
7 | 40303246334225163 |
oct | 3654547142436203 |
9 | 581033741447040 |
10 | 135013262310531 |
11 | 3a023891870a00 |
12 | 13186584458283 |
13 | 5a44908180c77 |
14 | 254a9690725a3 |
15 | 1092011283756 |
hex | 7acb398a3c83 |
135013262310531 has 36 divisors (see below), whose sum is σ = 214361618447704. Its totient is φ = 81825563413440.
The previous prime is 135013262310491. The next prime is 135013262310533.
135013262310531 is a `hidden beast` number, since 1 + 3 + 5 + 0 + 1 + 32 + 62 + 31 + 0 + 531 = 666.
135013262310531 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 135013262310531 - 229 = 135012725439619 is a prime.
It is a super-2 number, since 2×1350132623105312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (135013262310533) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 158791071 + ... + 159639063.
Almost surely, 2135013262310531 is an apocalyptic number.
135013262310531 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
135013262310531 is a deficient number, since it is larger than the sum of its proper divisors (79348356137173).
135013262310531 is a wasteful number, since it uses less digits than its factorization.
135013262310531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 994224 (or 994210 counting only the distinct ones).
The product of its (nonzero) digits is 48600, while the sum is 36.
The spelling of 135013262310531 in words is "one hundred thirty-five trillion, thirteen billion, two hundred sixty-two million, three hundred ten thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •