Base | Representation |
---|---|
bin | 111111100011001000… |
… | …1111010011010011111 |
3 | 111001020212110021212211 |
4 | 1333012101322122133 |
5 | 4213442431230110 |
6 | 142405501541251 |
7 | 12600603465556 |
oct | 1770621723237 |
9 | 431225407784 |
10 | 136470570655 |
11 | 52971096691 |
12 | 22547874827 |
13 | cb3b5c0373 |
14 | 68689acd9d |
15 | 383ae4e98a |
hex | 1fc647a69f |
136470570655 has 4 divisors (see below), whose sum is σ = 163764684792. Its totient is φ = 109176456520.
The previous prime is 136470570653. The next prime is 136470570667. The reversal of 136470570655 is 556075074631.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 556075074631 = 21313 ⋅26090887.
It is not a de Polignac number, because 136470570655 - 21 = 136470570653 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 136470570599 and 136470570608.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136470570653) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13647057061 + ... + 13647057070.
It is an arithmetic number, because the mean of its divisors is an integer number (40941171198).
Almost surely, 2136470570655 is an apocalyptic number.
136470570655 is a deficient number, since it is larger than the sum of its proper divisors (27294114137).
136470570655 is an equidigital number, since it uses as much as digits as its factorization.
136470570655 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27294114136.
The product of its (nonzero) digits is 2646000, while the sum is 49.
The spelling of 136470570655 in words is "one hundred thirty-six billion, four hundred seventy million, five hundred seventy thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •