Base | Representation |
---|---|
bin | 110011010100001111… |
… | …1100010001100011101 |
3 | 101112110002122220122012 |
4 | 1212220133202030131 |
5 | 3301142430134323 |
6 | 122343050201005 |
7 | 10650612140063 |
oct | 1465037421435 |
9 | 345402586565 |
10 | 110201021213 |
11 | 42810670348 |
12 | 19436123165 |
13 | a513050c7a |
14 | 5495b90033 |
15 | 2ceeaa4678 |
hex | 19a87e231d |
110201021213 has 8 divisors (see below), whose sum is σ = 112637806848. Its totient is φ = 107768072464.
The previous prime is 110201021179. The next prime is 110201021237. The reversal of 110201021213 is 312120102011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-110201021213 is a prime.
It is a super-3 number, since 3×1102010212133 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110201021713) 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, 901106 + ... + 1016067.
It is an arithmetic number, because the mean of its divisors is an integer number (14079725856).
Almost surely, 2110201021213 is an apocalyptic number.
It is an amenable number.
110201021213 is a deficient number, since it is larger than the sum of its proper divisors (2436785635).
110201021213 is a wasteful number, since it uses less digits than its factorization.
110201021213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1918443.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 110201021213 its reverse (312120102011), we get a palindrome (422321123224).
The spelling of 110201021213 in words is "one hundred ten billion, two hundred one million, twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •