Base | Representation |
---|---|
bin | 110011010001111001… |
… | …0111001101101110101 |
3 | 101112020121101000000100 |
4 | 1212203302321231311 |
5 | 3301012241242323 |
6 | 122331153104313 |
7 | 10645634234166 |
oct | 1464362715565 |
9 | 345217330010 |
10 | 110122212213 |
11 | 42780132a42 |
12 | 19413858099 |
13 | a4cc919a20 |
14 | 548951776d |
15 | 2ce7bd8943 |
hex | 19a3cb9b75 |
110122212213 has 72 divisors (see below), whose sum is σ = 182216512296. Its totient is φ = 63695001600.
The previous prime is 110122212199. The next prime is 110122212241. The reversal of 110122212213 is 312212221011.
It can be written as a sum of positive squares in 12 ways, for example, as 16245541764 + 93876670449 = 127458^2 + 306393^2 .
It is not a de Polignac number, because 110122212213 - 25 = 110122212181 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110122212293) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 31816303 + ... + 31819763.
It is an arithmetic number, because the mean of its divisors is an integer number (2530784893).
Almost surely, 2110122212213 is an apocalyptic number.
110122212213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
110122212213 is a deficient number, since it is larger than the sum of its proper divisors (72094300083).
110122212213 is a wasteful number, since it uses less digits than its factorization.
110122212213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4455 (or 4435 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 110122212213 its reverse (312212221011), we get a palindrome (422334433224).
The spelling of 110122212213 in words is "one hundred ten billion, one hundred twenty-two million, two hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •