Base | Representation |
---|---|
bin | 11110110011111011110100… |
… | …001000011110001010110110 |
3 | 122202210122210210001011110220 |
4 | 132303323310020132022312 |
5 | 120230200110344101410 |
6 | 1200112325011355210 |
7 | 40354203623263500 |
oct | 3663736410361266 |
9 | 582718723034426 |
10 | 135510314050230 |
11 | 3a1a5668597839 |
12 | 13246981bb2b06 |
13 | 5a7c74c561702 |
14 | 2566a3c8bad70 |
15 | 109ee03143070 |
hex | 7b3ef421e2b6 |
135510314050230 has 96 divisors (see below), whose sum is σ = 378327094800480. Its totient is φ = 30973424025600.
The previous prime is 135510314050187. The next prime is 135510314050253. The reversal of 135510314050230 is 32050413015531.
It is a junction number, because it is equal to n+sod(n) for n = 135510314050191 and 135510314050200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 137248566 + ... + 138232374.
It is an arithmetic number, because the mean of its divisors is an integer number (3940907237505).
Almost surely, 2135510314050230 is an apocalyptic number.
135510314050230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
135510314050230 is an abundant number, since it is smaller than the sum of its proper divisors (242816780750250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135510314050230 is a wasteful number, since it uses less digits than its factorization.
135510314050230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1077534 (or 1077527 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 33.
Adding to 135510314050230 its reverse (32050413015531), we get a palindrome (167560727065761).
The spelling of 135510314050230 in words is "one hundred thirty-five trillion, five hundred ten billion, three hundred fourteen million, fifty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •