Base | Representation |
---|---|
bin | 110000010000000101000000… |
… | …100011001101101101101111 |
3 | 1000211101011222222012010022202 |
4 | 300100011000203031231233 |
5 | 210303331334224213403 |
6 | 2031200235454532115 |
7 | 62461514301512006 |
oct | 6020050043155557 |
9 | 1024334888163282 |
10 | 212211122101103 |
11 | 61687260103544 |
12 | 1b973b2b50703b |
13 | 91545662a6638 |
14 | 3a59104899c3d |
15 | 1980171a91688 |
hex | c101408cdb6f |
212211122101103 has 32 divisors (see below), whose sum is σ = 217049090872320. Its totient is φ = 207440578800000.
The previous prime is 212211122101093. The next prime is 212211122101127. The reversal of 212211122101103 is 301101221112212.
It is a cyclic number.
It is not a de Polignac number, because 212211122101103 - 26 = 212211122101039 is a prime.
It is a super-2 number, since 2×2122111221011032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212211122101603) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2312352608 + ... + 2312444378.
It is an arithmetic number, because the mean of its divisors is an integer number (6782784089760).
Almost surely, 2212211122101103 is an apocalyptic number.
212211122101103 is a deficient number, since it is larger than the sum of its proper divisors (4837968771217).
212211122101103 is a wasteful number, since it uses less digits than its factorization.
212211122101103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92799.
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 212211122101103 its reverse (301101221112212), we get a palindrome (513312343213315).
The spelling of 212211122101103 in words is "two hundred twelve trillion, two hundred eleven billion, one hundred twenty-two million, one hundred one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •