Base | Representation |
---|---|
bin | 111111100000010001… |
… | …1110110110000111000 |
3 | 111001000011220000222112 |
4 | 1333000203312300320 |
5 | 4213243400023000 |
6 | 142352153111452 |
7 | 12565330032035 |
oct | 1770043666070 |
9 | 431004800875 |
10 | 136374611000 |
11 | 52921a04791 |
12 | 2251b6b8588 |
13 | cb247628c4 |
14 | 6859d5038c |
15 | 38327e7235 |
hex | 1fc08f6c38 |
136374611000 has 128 divisors (see below), whose sum is σ = 333118656000. Its totient is φ = 52195968000.
The previous prime is 136374610993. The next prime is 136374611017. The reversal of 136374611000 is 116473631.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2734286 + ... + 2783714.
It is an arithmetic number, because the mean of its divisors is an integer number (2602489500).
Almost surely, 2136374611000 is an apocalyptic number.
136374611000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 136374611000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (166559328000).
136374611000 is an abundant number, since it is smaller than the sum of its proper divisors (196744045000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136374611000 is a wasteful number, since it uses less digits than its factorization.
136374611000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49570 (or 49556 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 32.
The spelling of 136374611000 in words is "one hundred thirty-six billion, three hundred seventy-four million, six hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •