Base | Representation |
---|---|
bin | 100110110010101001011100… |
… | …1111100101011101110011011 |
3 | 1122202010121002220110120011012 |
4 | 1031211102321330223232123 |
5 | 324210411200344243443 |
6 | 3205410505332524135 |
7 | 131604534605651261 |
oct | 11545227174535633 |
9 | 1582117086416135 |
10 | 341212501556123 |
11 | 997a245581184a |
12 | 3232932848064b |
13 | 1185127c2ca262 |
14 | 6038ab78d6431 |
15 | 296aac0a5b118 |
hex | 13654b9f2bb9b |
341212501556123 has 2 divisors, whose sum is σ = 341212501556124. Its totient is φ = 341212501556122.
The previous prime is 341212501556023. The next prime is 341212501556153. The reversal of 341212501556123 is 321655105212143.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 341212501556123 - 210 = 341212501555099 is a prime.
It is a super-2 number, since 2×3412125015561232 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (341212501556153) 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 as a sum of consecutive naturals, namely, 170606250778061 + 170606250778062.
It is an arithmetic number, because the mean of its divisors is an integer number (170606250778062).
Almost surely, 2341212501556123 is an apocalyptic number.
341212501556123 is a deficient number, since it is larger than the sum of its proper divisors (1).
341212501556123 is an equidigital number, since it uses as much as digits as its factorization.
341212501556123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216000, while the sum is 41.
Adding to 341212501556123 its reverse (321655105212143), we get a palindrome (662867606768266).
The spelling of 341212501556123 in words is "three hundred forty-one trillion, two hundred twelve billion, five hundred one million, five hundred fifty-six thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •