Base | Representation |
---|---|
bin | 11110111111110010111100… |
… | …111010111001001000010110 |
3 | 122212200120202201101110002220 |
4 | 132333302330322321020112 |
5 | 120332023440432430011 |
6 | 1201535012204043210 |
7 | 40500121164451545 |
oct | 3677627472711026 |
9 | 585616681343086 |
10 | 136325431530006 |
11 | 3a48a322113874 |
12 | 13358947233506 |
13 | 5b0b5824aab94 |
14 | 25942868c815c |
15 | 10b620d703506 |
hex | 7bfcbceb9216 |
136325431530006 has 8 divisors (see below), whose sum is σ = 272650863060024. Its totient is φ = 45441810510000.
The previous prime is 136325431529999. The next prime is 136325431530017. The reversal of 136325431530006 is 600035134523631.
It is a sphenic number, since it is the product of 3 distinct primes.
136325431530006 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 136325431530006.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11360452627495 + ... + 11360452627506.
It is an arithmetic number, because the mean of its divisors is an integer number (34081357882503).
Almost surely, 2136325431530006 is an apocalyptic number.
136325431530006 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136325431530006 is a wasteful number, since it uses less digits than its factorization.
136325431530006 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22720905255006.
The product of its (nonzero) digits is 583200, while the sum is 42.
The spelling of 136325431530006 in words is "one hundred thirty-six trillion, three hundred twenty-five billion, four hundred thirty-one million, five hundred thirty thousand, six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •