Base | Representation |
---|---|
bin | 110000100001110000… |
… | …1011001011000101111 |
3 | 100221222201100022102211 |
4 | 1201003201121120233 |
5 | 3201411240341221 |
6 | 115512505431251 |
7 | 10346320516105 |
oct | 1410341313057 |
9 | 327881308384 |
10 | 104212043311 |
11 | 40217a88632 |
12 | 1824449b527 |
13 | 9a9a34406c |
14 | 508860dc75 |
15 | 2a9dde76e1 |
hex | 184385962f |
104212043311 has 4 divisors (see below), whose sum is σ = 105007555224. Its totient is φ = 103416531400.
The previous prime is 104212043303. The next prime is 104212043317. The reversal of 104212043311 is 113340212401.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 113340212401 = 13 ⋅8718477877.
It is a cyclic number.
It is not a de Polignac number, because 104212043311 - 23 = 104212043303 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 (104212043317) 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, 397755760 + ... + 397756021.
It is an arithmetic number, because the mean of its divisors is an integer number (26251888806).
Almost surely, 2104212043311 is an apocalyptic number.
104212043311 is a deficient number, since it is larger than the sum of its proper divisors (795511913).
104212043311 is an equidigital number, since it uses as much as digits as its factorization.
104212043311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 795511912.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 104212043311 its reverse (113340212401), we get a palindrome (217552255712).
The spelling of 104212043311 in words is "one hundred four billion, two hundred twelve million, forty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •