Base | Representation |
---|---|
bin | 11001000011110100001001… |
… | …010101011101001011011111 |
3 | 112110020021211020110120020201 |
4 | 121003310021111131023133 |
5 | 103421213330433332033 |
6 | 1030223144032524331 |
7 | 32133435424153606 |
oct | 3103641125351337 |
9 | 473207736416221 |
10 | 110213312402143 |
11 | 32132226661135 |
12 | 104400b33b06a7 |
13 | 49660bc613162 |
14 | 1d304d206ca3d |
15 | cb1d7b74747d |
hex | 643d0955d2df |
110213312402143 has 4 divisors (see below), whose sum is σ = 110213333398800. Its totient is φ = 110213291405488.
The previous prime is 110213312402131. The next prime is 110213312402201. The reversal of 110213312402143 is 341204213312011.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 110213312402143 - 233 = 110204722467551 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 (110213312412143) 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, 5189571 + ... + 15727627.
It is an arithmetic number, because the mean of its divisors is an integer number (27553333349700).
Almost surely, 2110213312402143 is an apocalyptic number.
110213312402143 is a deficient number, since it is larger than the sum of its proper divisors (20996657).
110213312402143 is a wasteful number, since it uses less digits than its factorization.
110213312402143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20996656.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 110213312402143 its reverse (341204213312011), we get a palindrome (451417525714154).
The spelling of 110213312402143 in words is "one hundred ten trillion, two hundred thirteen billion, three hundred twelve million, four hundred two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •