Base | Representation |
---|---|
bin | 1010001011101101101110… |
… | …1011001110101101111111 |
3 | 1110122100210022001022121222 |
4 | 2202323123223032231333 |
5 | 2431420131300104114 |
6 | 35451312544543555 |
7 | 2233624331264600 |
oct | 242733353165577 |
9 | 43570708038558 |
10 | 11196370316159 |
11 | 36273991779a6 |
12 | 1309b21921bbb |
13 | 632a7576bcc2 |
14 | 2a9c9b57bda7 |
15 | 14639b15698e |
hex | a2edbaceb7f |
11196370316159 has 6 divisors (see below), whose sum is σ = 13024349143344. Its totient is φ = 9596888842380.
The previous prime is 11196370316113. The next prime is 11196370316171. The reversal of 11196370316159 is 95161307369111.
It is a happy number.
It is not a de Polignac number, because 11196370316159 - 216 = 11196370250623 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11196370316159.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11196370316059) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 114248676647 + ... + 114248676744.
It is an arithmetic number, because the mean of its divisors is an integer number (2170724857224).
Almost surely, 211196370316159 is an apocalyptic number.
11196370316159 is a deficient number, since it is larger than the sum of its proper divisors (1827978827185).
11196370316159 is an equidigital number, since it uses as much as digits as its factorization.
11196370316159 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228497353405 (or 228497353398 counting only the distinct ones).
The product of its (nonzero) digits is 918540, while the sum is 53.
The spelling of 11196370316159 in words is "eleven trillion, one hundred ninety-six billion, three hundred seventy million, three hundred sixteen thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •