Base | Representation |
---|---|
bin | 11110111011001101101010… |
… | …001110000100101010000111 |
3 | 122211120110220101200010200011 |
4 | 132323031222032010222013 |
5 | 120311344011411431143 |
6 | 1201134211045331051 |
7 | 40435302160023121 |
oct | 3673155216045207 |
9 | 584513811603604 |
10 | 136010511436423 |
11 | 3a378808a12418 |
12 | 133078b9106a87 |
13 | 5ab797555cb40 |
14 | 2582d30002211 |
15 | 10ace2b265e9d |
hex | 7bb36a384a87 |
136010511436423 has 8 divisors (see below), whose sum is σ = 146806509634400. Its totient is φ = 125262177690528.
The previous prime is 136010511436339. The next prime is 136010511436439. The reversal of 136010511436423 is 324634115010631.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 136010511436423 - 237 = 135873072482951 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136010511436463) 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, 11916107088 + ... + 11916118501.
It is an arithmetic number, because the mean of its divisors is an integer number (18350813704300).
Almost surely, 2136010511436423 is an apocalyptic number.
136010511436423 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
136010511436423 is a deficient number, since it is larger than the sum of its proper divisors (10795998197977).
136010511436423 is a wasteful number, since it uses less digits than its factorization.
136010511436423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23832226041.
The product of its (nonzero) digits is 155520, while the sum is 40.
The spelling of 136010511436423 in words is "one hundred thirty-six trillion, ten billion, five hundred eleven million, four hundred thirty-six thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •