Base | Representation |
---|---|
bin | 110000100001110001… |
… | …0000010101001110101 |
3 | 100221222201122220022012 |
4 | 1201003202002221311 |
5 | 3201411311243331 |
6 | 115512513214005 |
7 | 10346322121646 |
oct | 1410342025165 |
9 | 327881586265 |
10 | 104212212341 |
11 | 40218093626 |
12 | 18244561305 |
13 | 9a9a3a2c93 |
14 | 50886556cd |
15 | 2a9de2c82b |
hex | 1843882a75 |
104212212341 has 4 divisors (see below), whose sum is σ = 104735892000. Its totient is φ = 103688532684.
The previous prime is 104212212289. The next prime is 104212212353. The reversal of 104212212341 is 143212212401.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 143212212401 = 263 ⋅544533127.
It is a cyclic number.
It is not a de Polignac number, because 104212212341 - 230 = 103138470517 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104212212361) 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, 261839531 + ... + 261839928.
It is an arithmetic number, because the mean of its divisors is an integer number (26183973000).
Almost surely, 2104212212341 is an apocalyptic number.
It is an amenable number.
104212212341 is a deficient number, since it is larger than the sum of its proper divisors (523679659).
104212212341 is an equidigital number, since it uses as much as digits as its factorization.
104212212341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 523679658.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 104212212341 its reverse (143212212401), we get a palindrome (247424424742).
The spelling of 104212212341 in words is "one hundred four billion, two hundred twelve million, two hundred twelve thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •