Base | Representation |
---|---|
bin | 110011001111011111… |
… | …0010111110100111101 |
3 | 101112000222011220122220 |
4 | 1212132332113310331 |
5 | 3300331040124203 |
6 | 122315143355553 |
7 | 10643632616661 |
oct | 1463676276475 |
9 | 345028156586 |
10 | 110041333053 |
11 | 42739511263 |
12 | 193b0752bb9 |
13 | a4b8c3c432 |
14 | 547c8a28a1 |
15 | 2ce0a5e653 |
hex | 199ef97d3d |
110041333053 has 4 divisors (see below), whose sum is σ = 146721777408. Its totient is φ = 73360888700.
The previous prime is 110041333043. The next prime is 110041333063. The reversal of 110041333053 is 350333140011.
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 an interprime number because it is at equal distance from previous prime (110041333043) and next prime (110041333063).
It is a cyclic number.
It is not a de Polignac number, because 110041333053 - 24 = 110041333037 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110041333043) 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, 18340222173 + ... + 18340222178.
It is an arithmetic number, because the mean of its divisors is an integer number (36680444352).
Almost surely, 2110041333053 is an apocalyptic number.
It is an amenable number.
110041333053 is a deficient number, since it is larger than the sum of its proper divisors (36680444355).
110041333053 is an equidigital number, since it uses as much as digits as its factorization.
110041333053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36680444354.
The product of its (nonzero) digits is 1620, while the sum is 24.
Adding to 110041333053 its reverse (350333140011), we get a palindrome (460374473064).
The spelling of 110041333053 in words is "one hundred ten billion, forty-one million, three hundred thirty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •