Base | Representation |
---|---|
bin | 11110110001011110001100… |
… | …001010111110001011111111 |
3 | 122202012110221121021001011220 |
4 | 132301132030022332023333 |
5 | 120214412000413310110 |
6 | 1155502454421444423 |
7 | 40336032534003111 |
oct | 3661361412761377 |
9 | 582173847231156 |
10 | 135341066150655 |
11 | 3a13a907564872 |
12 | 1321a009270713 |
13 | 5a697b9389181 |
14 | 255c784aa13b1 |
15 | 109a7e985c370 |
hex | 7b178c2be2ff |
135341066150655 has 16 divisors (see below), whose sum is σ = 219595645361664. Its totient is φ = 71165255440160.
The previous prime is 135341066150621. The next prime is 135341066150707. The reversal of 135341066150655 is 556051660143531.
It is not a de Polignac number, because 135341066150655 - 217 = 135341066019583 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 135341066150598 and 135341066150607.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 63540405579 + ... + 63540407708.
It is an arithmetic number, because the mean of its divisors is an integer number (13724727835104).
Almost surely, 2135341066150655 is an apocalyptic number.
135341066150655 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
135341066150655 is a deficient number, since it is larger than the sum of its proper divisors (84254579211009).
135341066150655 is a wasteful number, since it uses less digits than its factorization.
135341066150655 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127080813366.
The product of its (nonzero) digits is 4860000, while the sum is 51.
The spelling of 135341066150655 in words is "one hundred thirty-five trillion, three hundred forty-one billion, sixty-six million, one hundred fifty thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •