Base | Representation |
---|---|
bin | 110011010010001000… |
… | …1000000010000010001 |
3 | 101112021011012220120022 |
4 | 1212210101000100101 |
5 | 3301021301301223 |
6 | 122332034153225 |
7 | 10646061301256 |
oct | 1464421002021 |
9 | 345234186508 |
10 | 110130103313 |
11 | 4278463270a |
12 | 19416422815 |
13 | a501450709 |
14 | 548a5ad42d |
15 | 2ce8746ac8 |
hex | 19a4440411 |
110130103313 has 8 divisors (see below), whose sum is σ = 115929517920. Its totient is φ = 104330998080.
The previous prime is 110130103297. The next prime is 110130103319. The reversal of 110130103313 is 313301031011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110130103313 - 24 = 110130103297 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 110130103291 and 110130103300.
It is not an unprimeable number, because it can be changed into a prime (110130103319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1166006 + ... + 1256912.
It is an arithmetic number, because the mean of its divisors is an integer number (14491189740).
Almost surely, 2110130103313 is an apocalyptic number.
It is an amenable number.
110130103313 is a deficient number, since it is larger than the sum of its proper divisors (5799414607).
110130103313 is an equidigital number, since it uses as much as digits as its factorization.
110130103313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154687.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 110130103313 its reverse (313301031011), we get a palindrome (423431134324).
The spelling of 110130103313 in words is "one hundred ten billion, one hundred thirty million, one hundred three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •