Base | Representation |
---|---|
bin | 10001101110100010000… |
… | …110010010001101100001 |
3 | 11022110101010101011220112 |
4 | 101232202012102031201 |
5 | 124424330444114332 |
6 | 2331344201021105 |
7 | 154004005132316 |
oct | 21564206221541 |
9 | 4273333334815 |
10 | 1218195301217 |
11 | 42a6a7542214 |
12 | 178117184795 |
13 | 8ab4c11892b |
14 | 42d64c72d0d |
15 | 21a4c2c0db2 |
hex | 11ba2192361 |
1218195301217 has 4 divisors (see below), whose sum is σ = 1219913489940. Its totient is φ = 1216477112496.
The previous prime is 1218195301199. The next prime is 1218195301223. The reversal of 1218195301217 is 7121035918121.
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 664683108961 + 553512192256 = 815281^2 + 743984^2 .
It is a cyclic number.
It is not a de Polignac number, because 1218195301217 - 228 = 1217926865761 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1218195201217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 859093298 + ... + 859094715.
It is an arithmetic number, because the mean of its divisors is an integer number (304978372485).
Almost surely, 21218195301217 is an apocalyptic number.
It is an amenable number.
1218195301217 is a deficient number, since it is larger than the sum of its proper divisors (1718188723).
1218195301217 is an equidigital number, since it uses as much as digits as its factorization.
1218195301217 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1718188722.
The product of its (nonzero) digits is 30240, while the sum is 41.
The spelling of 1218195301217 in words is "one trillion, two hundred eighteen billion, one hundred ninety-five million, three hundred one thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •