Base | Representation |
---|---|
bin | 110011001110100101… |
… | …1100000010011011101 |
3 | 101111221212112001222120 |
4 | 1212131023200103131 |
5 | 3300300333034323 |
6 | 122312150133153 |
7 | 10643115644235 |
oct | 1463513402335 |
9 | 344855461876 |
10 | 110011221213 |
11 | 42723514843 |
12 | 193a26511b9 |
13 | a4b292858a |
14 | 54788a4cc5 |
15 | 2cdd0b25e3 |
hex | 199d2e04dd |
110011221213 has 16 divisors (see below), whose sum is σ = 150709575936. Its totient is φ = 71328513600.
The previous prime is 110011221191. The next prime is 110011221233. The reversal of 110011221213 is 312122110011.
It is not a de Polignac number, because 110011221213 - 25 = 110011221181 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110011221192 and 110011221201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110011221233) 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 15 ways as a sum of consecutive naturals, for example, 56563 + ... + 472463.
It is an arithmetic number, because the mean of its divisors is an integer number (9419348496).
Almost surely, 2110011221213 is an apocalyptic number.
It is an amenable number.
110011221213 is a deficient number, since it is larger than the sum of its proper divisors (40698354723).
110011221213 is a wasteful number, since it uses less digits than its factorization.
110011221213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 418324.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 110011221213 its reverse (312122110011), we get a palindrome (422133331224).
The spelling of 110011221213 in words is "one hundred ten billion, eleven million, two hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •