Base | Representation |
---|---|
bin | 110011010100001111… |
… | …1111010011000111001 |
3 | 101112110002211221120120 |
4 | 1212220133322120321 |
5 | 3301142441322223 |
6 | 122343052243453 |
7 | 10650613032024 |
oct | 1465037723071 |
9 | 345402757516 |
10 | 110201120313 |
11 | 42810728849 |
12 | 19436170589 |
13 | a5130870cb |
14 | 5495bb81bb |
15 | 2ceeac3be3 |
hex | 19a87fa639 |
110201120313 has 8 divisors (see below), whose sum is σ = 149707182528. Its totient is φ = 72081235824.
The previous prime is 110201120287. The next prime is 110201120327. The reversal of 110201120313 is 313021102011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110201120313 - 221 = 110199023161 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110201120292 and 110201120301.
It is not an unprimeable number, because it can be changed into a prime (110201121313) 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, 346544245 + ... + 346544562.
It is an arithmetic number, because the mean of its divisors is an integer number (18713397816).
Almost surely, 2110201120313 is an apocalyptic number.
It is an amenable number.
110201120313 is a deficient number, since it is larger than the sum of its proper divisors (39506062215).
110201120313 is an equidigital number, since it uses as much as digits as its factorization.
110201120313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 693088863.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 110201120313 its reverse (313021102011), we get a palindrome (423222222324).
The spelling of 110201120313 in words is "one hundred ten billion, two hundred one million, one hundred twenty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •