Base | Representation |
---|---|
bin | 110011010100100101… |
… | …0010000110000111101 |
3 | 101112110212201222020122 |
4 | 1212221022100300331 |
5 | 3301203312101023 |
6 | 122344130224325 |
7 | 10651106300345 |
oct | 1465112206075 |
9 | 345425658218 |
10 | 110212222013 |
11 | 42816a20703 |
12 | 19439a250a5 |
13 | a51547326a |
14 | 5497467d25 |
15 | 2d00a682c8 |
hex | 19a9290c3d |
110212222013 has 8 divisors (see below), whose sum is σ = 110384726400. Its totient is φ = 110039772448.
The previous prime is 110212221941. The next prime is 110212222037. The reversal of 110212222013 is 310222212011.
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 110212222013 - 214 = 110212205629 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110212221982 and 110212222000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110212222063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6003833 + ... + 6022161.
It is an arithmetic number, because the mean of its divisors is an integer number (13798090800).
Almost surely, 2110212222013 is an apocalyptic number.
It is an amenable number.
110212222013 is a deficient number, since it is larger than the sum of its proper divisors (172504387).
110212222013 is an equidigital number, since it uses as much as digits as its factorization.
110212222013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27411.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 110212222013 its reverse (310222212011), we get a palindrome (420434434024).
The spelling of 110212222013 in words is "one hundred ten billion, two hundred twelve million, two hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •