Base | Representation |
---|---|
bin | 110011010100110101… |
… | …1110010100100001101 |
3 | 101112111111021111202120 |
4 | 1212221223302210031 |
5 | 3301213034324323 |
6 | 122345042443153 |
7 | 10651244065005 |
oct | 1465153624415 |
9 | 345444244676 |
10 | 110221011213 |
11 | 42820984105 |
12 | 194409634b9 |
13 | a51722c981 |
14 | 54986b5005 |
15 | 2d017025e3 |
hex | 19a9af290d |
110221011213 has 16 divisors (see below), whose sum is σ = 153781082496. Its totient is φ = 70145749440.
The previous prime is 110221011193. The next prime is 110221011223. The reversal of 110221011213 is 312110122011.
It is not a de Polignac number, because 110221011213 - 210 = 110221010189 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110221011192 and 110221011201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110221011223) 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, 9361873 + ... + 9373638.
It is an arithmetic number, because the mean of its divisors is an integer number (9611317656).
Almost surely, 2110221011213 is an apocalyptic number.
It is an amenable number.
110221011213 is a deficient number, since it is larger than the sum of its proper divisors (43560071283).
110221011213 is a wasteful number, since it uses less digits than its factorization.
110221011213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18735604.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 110221011213 its reverse (312110122011), we get a palindrome (422331133224).
The spelling of 110221011213 in words is "one hundred ten billion, two hundred twenty-one million, eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •