Base | Representation |
---|---|
bin | 1100010110100101101… |
… | …1000100111001010011 |
3 | 202021210010022212001110 |
4 | 3011221123010321103 |
5 | 11434112324244443 |
6 | 241254332104403 |
7 | 21222030053502 |
oct | 3055133047123 |
9 | 667703285043 |
10 | 212222103123 |
11 | 82003932178 |
12 | 35168905103 |
13 | 170214a9764 |
14 | a3b33d6839 |
15 | 57c1468233 |
hex | 31696c4e53 |
212222103123 has 16 divisors (see below), whose sum is σ = 284435987616. Its totient is φ = 140744997120.
The previous prime is 212222103109. The next prime is 212222103127. The reversal of 212222103123 is 321301222212.
212222103123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 212222103123 - 26 = 212222103059 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 212222103123.
It is not an unprimeable number, because it can be changed into a prime (212222103127) 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, 5762215 + ... + 5798927.
It is an arithmetic number, because the mean of its divisors is an integer number (17777249226).
Almost surely, 2212222103123 is an apocalyptic number.
212222103123 is a deficient number, since it is larger than the sum of its proper divisors (72213884493).
212222103123 is a wasteful number, since it uses less digits than its factorization.
212222103123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46694.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 212222103123 its reverse (321301222212), we get a palindrome (533523325335).
The spelling of 212222103123 in words is "two hundred twelve billion, two hundred twenty-two million, one hundred three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •