Base | Representation |
---|---|
bin | 111111100001010000… |
… | …1011010101001100110 |
3 | 111001002110211021212020 |
4 | 1333002201122221212 |
5 | 4213330311312430 |
6 | 142355330404010 |
7 | 12566206561101 |
oct | 1770241325146 |
9 | 431073737766 |
10 | 136407525990 |
11 | 5293954625a |
12 | 2252a730606 |
13 | cb2b518628 |
14 | 686047b738 |
15 | 3835649b10 |
hex | 1fc285aa66 |
136407525990 has 32 divisors (see below), whose sum is σ = 328316133600. Its totient is φ = 36271110144.
The previous prime is 136407525973. The next prime is 136407526007. The reversal of 136407525990 is 99525704631.
It is an interprime number because it is at equal distance from previous prime (136407525973) and next prime (136407526007).
It is a super-3 number, since 3×1364075259903 (a number of 34 digits) contains 333 as substring.
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 15 ways as a sum of consecutive naturals, for example, 6503739 + ... + 6524678.
It is an arithmetic number, because the mean of its divisors is an integer number (10259879175).
Almost surely, 2136407525990 is an apocalyptic number.
136407525990 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
136407525990 is an abundant number, since it is smaller than the sum of its proper divisors (191908607610).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136407525990 is a wasteful number, since it uses less digits than its factorization.
136407525990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13028776.
The product of its (nonzero) digits is 2041200, while the sum is 51.
The spelling of 136407525990 in words is "one hundred thirty-six billion, four hundred seven million, five hundred twenty-five thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •