Base | Representation |
---|---|
bin | 11111000110101110100101… |
… | …011001111111110110011101 |
3 | 122221101010022011001200202010 |
4 | 133012232211121333312131 |
5 | 120412330020232310134 |
6 | 1202541511442421433 |
7 | 40546413412162404 |
oct | 3706564531776635 |
9 | 587333264050663 |
10 | 136801778400669 |
11 | 3a653343546098 |
12 | 13415126961879 |
13 | 5b4447715b325 |
14 | 25ad3545a663b |
15 | 10c37dca11ce9 |
hex | 7c6ba567fd9d |
136801778400669 has 16 divisors (see below), whose sum is σ = 185440716373824. Its totient is φ = 89682789504000.
The previous prime is 136801778400643. The next prime is 136801778400673. The reversal of 136801778400669 is 966004877108631.
It is a de Polignac number, because none of the positive numbers 2k-136801778400669 is a prime.
It is a super-2 number, since 2×1368017784006692 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136801778400769) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 96354564 + ... + 97764029.
It is an arithmetic number, because the mean of its divisors is an integer number (11590044773364).
Almost surely, 2136801778400669 is an apocalyptic number.
It is an amenable number.
136801778400669 is a deficient number, since it is larger than the sum of its proper divisors (48638937973155).
136801778400669 is a wasteful number, since it uses less digits than its factorization.
136801778400669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194122508.
The product of its (nonzero) digits is 73156608, while the sum is 66.
The spelling of 136801778400669 in words is "one hundred thirty-six trillion, eight hundred one billion, seven hundred seventy-eight million, four hundred thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •