Base | Representation |
---|---|
bin | 111111100011010001… |
… | …1000001010101101001 |
3 | 111001021011220010212220 |
4 | 1333012203001111221 |
5 | 4214000103233330 |
6 | 142410142024253 |
7 | 12600656555040 |
oct | 1770643012551 |
9 | 431234803786 |
10 | 136475055465 |
11 | 5297367a141 |
12 | 22549278089 |
13 | cb3c5007b8 |
14 | 6869419557 |
15 | 383b538710 |
hex | 1fc68c1569 |
136475055465 has 32 divisors (see below), whose sum is σ = 249614017536. Its totient is φ = 62373689280.
The previous prime is 136475055377. The next prime is 136475055503. The reversal of 136475055465 is 564550574631.
It is a happy number.
It is not a de Polignac number, because 136475055465 - 27 = 136475055337 is a prime.
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 31 ways as a sum of consecutive naturals, for example, 292350 + ... + 598680.
It is an arithmetic number, because the mean of its divisors is an integer number (7800438048).
Almost surely, 2136475055465 is an apocalyptic number.
136475055465 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
136475055465 is a deficient number, since it is larger than the sum of its proper divisors (113138962071).
136475055465 is a wasteful number, since it uses less digits than its factorization.
136475055465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 310589.
The product of its (nonzero) digits is 7560000, while the sum is 51.
The spelling of 136475055465 in words is "one hundred thirty-six billion, four hundred seventy-five million, fifty-five thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •