Base | Representation |
---|---|
bin | 11001000011101010101001… |
… | …010011000000010001010001 |
3 | 112110012022111022010102021202 |
4 | 121003222221103000101101 |
5 | 103421031432432241423 |
6 | 1030214335502000545 |
7 | 32132624554400033 |
oct | 3103525123002121 |
9 | 473168438112252 |
10 | 110203111212113 |
11 | 32128971321077 |
12 | 1043a126b76155 |
13 | 4965155042b3a |
14 | 1d2dc052d7c53 |
15 | cb1980d97728 |
hex | 643aa94c0451 |
110203111212113 has 4 divisors (see below), whose sum is σ = 110390850754800. Its totient is φ = 110015371669428.
The previous prime is 110203111212109. The next prime is 110203111212121. The reversal of 110203111212113 is 311212111302011.
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.
It is a cyclic number.
It is not a de Polignac number, because 110203111212113 - 22 = 110203111212109 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110203111211113) 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, 93869770463 + ... + 93869771636.
It is an arithmetic number, because the mean of its divisors is an integer number (27597712688700).
Almost surely, 2110203111212113 is an apocalyptic number.
It is an amenable number.
110203111212113 is a deficient number, since it is larger than the sum of its proper divisors (187739542687).
110203111212113 is an equidigital number, since it uses as much as digits as its factorization.
110203111212113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 187739542686.
The product of its (nonzero) digits is 72, while the sum is 20.
Adding to 110203111212113 its reverse (311212111302011), we get a palindrome (421415222514124).
The spelling of 110203111212113 in words is "one hundred ten trillion, two hundred three billion, one hundred eleven million, two hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •