Base | Representation |
---|---|
bin | 11110111100101110000110… |
… | …100111101001100100011001 |
3 | 122211221101012100221211120111 |
4 | 132330232012213221210121 |
5 | 120320043102140241421 |
6 | 1201253534511124321 |
7 | 40445626320552223 |
oct | 3674560647514431 |
9 | 584841170854514 |
10 | 136114067118361 |
11 | 3a408719446a32 |
12 | 133239998136a1 |
13 | 5ac4669903597 |
14 | 2587d55397413 |
15 | 10b098c70aee1 |
hex | 7bcb869e9919 |
136114067118361 has 4 divisors (see below), whose sum is σ = 136605453642532. Its totient is φ = 135622680594192.
The previous prime is 136114067118349. The next prime is 136114067118371. The reversal of 136114067118361 is 163811760411631.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 39319559021961 + 96794508096400 = 6270531^2 + 9838420^2 .
It is a cyclic number.
It is not a de Polignac number, because 136114067118361 - 29 = 136114067117849 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (136114067118371) 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, 245693261670 + ... + 245693262223.
It is an arithmetic number, because the mean of its divisors is an integer number (34151363410633).
Almost surely, 2136114067118361 is an apocalyptic number.
It is an amenable number.
136114067118361 is a deficient number, since it is larger than the sum of its proper divisors (491386524171).
136114067118361 is an equidigital number, since it uses as much as digits as its factorization.
136114067118361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 491386524170.
The product of its (nonzero) digits is 435456, while the sum is 49.
The spelling of 136114067118361 in words is "one hundred thirty-six trillion, one hundred fourteen billion, sixty-seven million, one hundred eighteen thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •