Base | Representation |
---|---|
bin | 11111000001001100011111… |
… | …011100101111011110000101 |
3 | 122220000202221001010101121212 |
4 | 133001030133130233132011 |
5 | 120340112340401213023 |
6 | 1202051112243421205 |
7 | 40510063526631533 |
oct | 3701143734573605 |
9 | 586022831111555 |
10 | 136421573851013 |
11 | 3a517078a32610 |
12 | 133734b9084805 |
13 | 5b17664a09819 |
14 | 2598ba7481153 |
15 | 10b8988e2be78 |
hex | 7c131f72f785 |
136421573851013 has 8 divisors (see below), whose sum is σ = 155294123593536. Its totient is φ = 118627455522400.
The previous prime is 136421573851001. The next prime is 136421573851019. The reversal of 136421573851013 is 310158375124631.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 136421573851013 - 210 = 136421573849989 is a prime.
It is a super-2 number, since 2×1364215738510132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136421573851019) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 269607853208 + ... + 269607853713.
It is an arithmetic number, because the mean of its divisors is an integer number (19411765449192).
Almost surely, 2136421573851013 is an apocalyptic number.
It is an amenable number.
136421573851013 is a deficient number, since it is larger than the sum of its proper divisors (18872549742523).
136421573851013 is a wasteful number, since it uses less digits than its factorization.
136421573851013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 539215706955.
The product of its (nonzero) digits is 1814400, while the sum is 50.
The spelling of 136421573851013 in words is "one hundred thirty-six trillion, four hundred twenty-one billion, five hundred seventy-three million, eight hundred fifty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •