Base | Representation |
---|---|
bin | 11110111011001000110110… |
… | …110001100011010001111011 |
3 | 122211112222120220211102021212 |
4 | 132323020312301203101323 |
5 | 120311302430424314423 |
6 | 1201131555145553335 |
7 | 40435030305035033 |
oct | 3673106661432173 |
9 | 584488526742255 |
10 | 136005353354363 |
11 | 3a376601352a89 |
12 | 133068b97a584b |
13 | 5ab7332a3278c |
14 | 25829a0d508c3 |
15 | 10acc284d5578 |
hex | 7bb236c6347b |
136005353354363 has 4 divisors (see below), whose sum is σ = 136021005952920. Its totient is φ = 135989700755808.
The previous prime is 136005353354303. The next prime is 136005353354471. The reversal of 136005353354363 is 363453353500631.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 136005353354363 - 232 = 136001058387067 is a prime.
It is a super-3 number, since 3×1360053533543633 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (136005353354303) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7826286245 + ... + 7826303622.
It is an arithmetic number, because the mean of its divisors is an integer number (34005251488230).
Almost surely, 2136005353354363 is an apocalyptic number.
136005353354363 is a deficient number, since it is larger than the sum of its proper divisors (15652598557).
136005353354363 is an equidigital number, since it uses as much as digits as its factorization.
136005353354363 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15652598556.
The product of its (nonzero) digits is 13122000, while the sum is 50.
The spelling of 136005353354363 in words is "one hundred thirty-six trillion, five billion, three hundred fifty-three million, three hundred fifty-four thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •