Base | Representation |
---|---|
bin | 110011011000011100… |
… | …1011100011101101101 |
3 | 101112210220222221222210 |
4 | 1212300321130131231 |
5 | 3301440024444323 |
6 | 122405044401033 |
7 | 10654243535001 |
oct | 1466071343555 |
9 | 345726887883 |
10 | 110342031213 |
11 | 42883222237 |
12 | 194753a6179 |
13 | a536322c3b |
14 | 54aa7b8701 |
15 | 2d0c15a293 |
hex | 19b0e5c76d |
110342031213 has 8 divisors (see below), whose sum is σ = 154866008800. Its totient is φ = 69689703888.
The previous prime is 110342031193. The next prime is 110342031227. The reversal of 110342031213 is 312130243011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110342031213 - 28 = 110342030957 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 110342031213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110342031313) 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, 967912498 + ... + 967912611.
It is an arithmetic number, because the mean of its divisors is an integer number (19358251100).
Almost surely, 2110342031213 is an apocalyptic number.
It is an amenable number.
110342031213 is a deficient number, since it is larger than the sum of its proper divisors (44523977587).
110342031213 is a wasteful number, since it uses less digits than its factorization.
110342031213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1935825131.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 110342031213 its reverse (312130243011), we get a palindrome (422472274224).
The spelling of 110342031213 in words is "one hundred ten billion, three hundred forty-two million, thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •