Base | Representation |
---|---|
bin | 11001000101010000001111… |
… | …100111101110110110010101 |
3 | 112110120202002000212221001212 |
4 | 121011100033213232312111 |
5 | 103424323342214313323 |
6 | 1030340420454231205 |
7 | 32143536126566114 |
oct | 3105201747566625 |
9 | 473522060787055 |
10 | 110312202104213 |
11 | 32170162288a3a |
12 | 104572b1355505 |
13 | 497251c0a7875 |
14 | 1d351d386dc7b |
15 | cb4718264b78 |
hex | 64540f9eed95 |
110312202104213 has 8 divisors (see below), whose sum is σ = 110676144324096. Its totient is φ = 109948319119600.
The previous prime is 110312202104177. The next prime is 110312202104239. The reversal of 110312202104213 is 312401202213011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110312202104213 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 (110312202134213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11076581 + ... + 18528762.
It is an arithmetic number, because the mean of its divisors is an integer number (13834518040512).
Almost surely, 2110312202104213 is an apocalyptic number.
It is an amenable number.
110312202104213 is a deficient number, since it is larger than the sum of its proper divisors (363942219883).
110312202104213 is a wasteful number, since it uses less digits than its factorization.
110312202104213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29617635.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 110312202104213 its reverse (312401202213011), we get a palindrome (422713404317224).
The spelling of 110312202104213 in words is "one hundred ten trillion, three hundred twelve billion, two hundred two million, one hundred four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •