Base | Representation |
---|---|
bin | 110011010111001110… |
… | …1010011011111101101 |
3 | 101112201001222102221102 |
4 | 1212232131103133231 |
5 | 3301344040200023 |
6 | 122401023212445 |
7 | 10653235611026 |
oct | 1465635233755 |
9 | 345631872842 |
10 | 110301100013 |
11 | 42862105aa5 |
12 | 19463747125 |
13 | a52a9c15b0 |
14 | 54a51a1c4d |
15 | 2d08772628 |
hex | 19ae7537ed |
110301100013 has 8 divisors (see below), whose sum is σ = 118788397728. Its totient is φ = 101814173424.
The previous prime is 110301099941. The next prime is 110301100027. The reversal of 110301100013 is 310001103011.
It is a happy number.
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-110301100013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110301099967 and 110301100003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110301100213) 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, 1010270 + ... + 1114112.
It is an arithmetic number, because the mean of its divisors is an integer number (14848549716).
Almost surely, 2110301100013 is an apocalyptic number.
110301100013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
110301100013 is a deficient number, since it is larger than the sum of its proper divisors (8487297715).
110301100013 is a wasteful number, since it uses less digits than its factorization.
110301100013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 185563.
The product of its (nonzero) digits is 9, while the sum is 11.
Adding to 110301100013 its reverse (310001103011), we get a palindrome (420302203024).
The spelling of 110301100013 in words is "one hundred ten billion, three hundred one million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •