Base | Representation |
---|---|
bin | 110011010100100100… |
… | …1110011001110010101 |
3 | 101112110212111211021011 |
4 | 1212221021303032111 |
5 | 3301203244213023 |
6 | 122344123452221 |
7 | 10651105254520 |
oct | 1465111631625 |
9 | 345425454234 |
10 | 110212101013 |
11 | 42816948803 |
12 | 19439987071 |
13 | a515430171 |
14 | 5497435bb7 |
15 | 2d00a4250d |
hex | 19a9273395 |
110212101013 has 8 divisors (see below), whose sum is σ = 126948472832. Its totient is φ = 93723675696.
The previous prime is 110212101011. The next prime is 110212101047. The reversal of 110212101013 is 310101212011.
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 110212101013 - 21 = 110212101011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110212100984 and 110212101002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110212101011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61985670 + ... + 61987447.
It is an arithmetic number, because the mean of its divisors is an integer number (15868559104).
Almost surely, 2110212101013 is an apocalyptic number.
It is an amenable number.
110212101013 is a deficient number, since it is larger than the sum of its proper divisors (16736371819).
110212101013 is a wasteful number, since it uses less digits than its factorization.
110212101013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123973251.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 110212101013 its reverse (310101212011), we get a palindrome (420313313024).
The spelling of 110212101013 in words is "one hundred ten billion, two hundred twelve million, one hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •