Base | Representation |
---|---|
bin | 11001000011110010000101… |
… | …100001101111011001111101 |
3 | 112110020002010010101012222020 |
4 | 121003302011201233121331 |
5 | 103421144313330430023 |
6 | 1030222140355310353 |
7 | 32133326552621544 |
oct | 3103620541573175 |
9 | 473202103335866 |
10 | 110211101030013 |
11 | 321312a1374565 |
12 | 1043b7968ab3b9 |
13 | 4965b2942c539 |
14 | 1d303624b115b |
15 | cb1c9c530de3 |
hex | 643c8586f67d |
110211101030013 has 8 divisors (see below), whose sum is σ = 146995218389376. Its totient is φ = 73450525512000.
The previous prime is 110211101029903. The next prime is 110211101030033. The reversal of 110211101030013 is 310030101112011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110211101030013 - 245 = 75026728941181 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110211101029974 and 110211101030001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110211101030033) 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, 5885449413 + ... + 5885468138.
It is an arithmetic number, because the mean of its divisors is an integer number (18374402298672).
Almost surely, 2110211101030013 is an apocalyptic number.
It is an amenable number.
110211101030013 is a deficient number, since it is larger than the sum of its proper divisors (36784117359363).
110211101030013 is a wasteful number, since it uses less digits than its factorization.
110211101030013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11770920675.
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 110211101030013 its reverse (310030101112011), we get a palindrome (420241202142024).
The spelling of 110211101030013 in words is "one hundred ten trillion, two hundred eleven billion, one hundred one million, thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •