Base | Representation |
---|---|
bin | 11111000000100010001001… |
… | …111100111011011000011111 |
3 | 122212212102121000012222101112 |
4 | 133000202021330323120133 |
5 | 120333341241201024210 |
6 | 1202014153420532235 |
7 | 40503564200563163 |
oct | 3700421174733037 |
9 | 585772530188345 |
10 | 136376116033055 |
11 | 3a4a9871201118 |
12 | 133667313b107b |
13 | 5b1329bcc23a2 |
14 | 25968d40baca3 |
15 | 10b76c8208d05 |
hex | 7c0889f3b61f |
136376116033055 has 24 divisors (see below), whose sum is σ = 172973138195520. Its totient is φ = 103097541915200.
The previous prime is 136376116033019. The next prime is 136376116033057. The reversal of 136376116033055 is 550330611673631.
It is not a de Polignac number, because 136376116033055 - 210 = 136376116032031 is a prime.
It is a super-2 number, since 2×1363761160330552 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 136376116032994 and 136376116033012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136376116033057) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 212564471 + ... + 213205080.
It is an arithmetic number, because the mean of its divisors is an integer number (7207214091480).
Almost surely, 2136376116033055 is an apocalyptic number.
136376116033055 is a deficient number, since it is larger than the sum of its proper divisors (36597022162465).
136376116033055 is an equidigital number, since it uses as much as digits as its factorization.
136376116033055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 425769679 (or 425769632 counting only the distinct ones).
The product of its (nonzero) digits is 3061800, while the sum is 50.
The spelling of 136376116033055 in words is "one hundred thirty-six trillion, three hundred seventy-six billion, one hundred sixteen million, thirty-three thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •