Base | Representation |
---|---|
bin | 1100011000001111100… |
… | …0110011011010001011 |
3 | 202022221001210101222110 |
4 | 3012003320303122023 |
5 | 11441020010302220 |
6 | 241410352353403 |
7 | 21236031024162 |
oct | 3060370633213 |
9 | 668831711873 |
10 | 212666103435 |
11 | 82211520185 |
12 | 35271545863 |
13 | 17092485636 |
14 | a4163723d9 |
15 | 57ea41dbe0 |
hex | 3183e3368b |
212666103435 has 32 divisors (see below), whose sum is σ = 351316611072. Its totient is φ = 109739859840.
The previous prime is 212666103427. The next prime is 212666103451. The reversal of 212666103435 is 534301666212.
212666103435 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 212666103435 - 23 = 212666103427 is a prime.
It is a super-2 number, since 2×2126661034352 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 212666103393 and 212666103402.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 2263617 + ... + 2355693.
It is an arithmetic number, because the mean of its divisors is an integer number (10978644096).
Almost surely, 2212666103435 is an apocalyptic number.
212666103435 is a deficient number, since it is larger than the sum of its proper divisors (138650507637).
212666103435 is a wasteful number, since it uses less digits than its factorization.
212666103435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97083.
The product of its (nonzero) digits is 155520, while the sum is 39.
Adding to 212666103435 its reverse (534301666212), we get a palindrome (746967769647).
The spelling of 212666103435 in words is "two hundred twelve billion, six hundred sixty-six million, one hundred three thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •