Base | Representation |
---|---|
bin | 11110111011010001001110… |
… | …011011110101101000100110 |
3 | 122211120211210020021000200222 |
4 | 132323101032123311220212 |
5 | 120311424332101001100 |
6 | 1201140043022204342 |
7 | 40435466101300265 |
oct | 3673211633655046 |
9 | 584524706230628 |
10 | 136014340250150 |
11 | 3a37a3a320388a |
12 | 133085a74236b2 |
13 | 5ab81358752ab |
14 | 25831b47145dc |
15 | 10ad0a2474485 |
hex | 7bb44e6f5a26 |
136014340250150 has 48 divisors (see below), whose sum is σ = 270815350190400. Its totient is φ = 50668678380960.
The previous prime is 136014340250143. The next prime is 136014340250153. The reversal of 136014340250150 is 51052043410631.
It is a self number, because there is not a number n which added to its sum of digits gives 136014340250150.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136014340250153) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1213274372 + ... + 1213386471.
It is an arithmetic number, because the mean of its divisors is an integer number (5641986462300).
Almost surely, 2136014340250150 is an apocalyptic number.
136014340250150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
136014340250150 is a deficient number, since it is larger than the sum of its proper divisors (134801009940250).
136014340250150 is a wasteful number, since it uses less digits than its factorization.
136014340250150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2426660933 (or 2426660928 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 35.
Adding to 136014340250150 its reverse (51052043410631), we get a palindrome (187066383660781).
The spelling of 136014340250150 in words is "one hundred thirty-six trillion, fourteen billion, three hundred forty million, two hundred fifty thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •