Base | Representation |
---|---|
bin | 111111100001011000… |
… | …0010100001011100010 |
3 | 111001002202011201102022 |
4 | 1333002300110023202 |
5 | 4213332311303100 |
6 | 142355550221442 |
7 | 12566255015624 |
oct | 1770260241342 |
9 | 431082151368 |
10 | 136411431650 |
11 | 5294077367a |
12 | 2252bab4882 |
13 | cb2c285280 |
14 | 6860bb6c14 |
15 | 3835b6be85 |
hex | 1fc2c142e2 |
136411431650 has 48 divisors (see below), whose sum is σ = 280627575144. Its totient is φ = 49006010880.
The previous prime is 136411431631. The next prime is 136411431683. The reversal of 136411431650 is 56134114631.
It can be written as a sum of positive squares in 12 ways, for example, as 15657266641 + 120754165009 = 125129^2 + 347497^2 .
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 136411431650.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2811947 + ... + 2860046.
Almost surely, 2136411431650 is an apocalyptic number.
136411431650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
136411431650 is an abundant number, since it is smaller than the sum of its proper divisors (144216143494).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136411431650 is a wasteful number, since it uses less digits than its factorization.
136411431650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5672055 (or 5672050 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 35.
The spelling of 136411431650 in words is "one hundred thirty-six billion, four hundred eleven million, four hundred thirty-one thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •