Base | Representation |
---|---|
bin | 11110110111100010000… |
… | …110011000100010001111 |
3 | 21111210012220222122202200 |
4 | 132313202012120202033 |
5 | 234223220310413403 |
6 | 4302245455052543 |
7 | 306152421133332 |
oct | 36674206304217 |
9 | 7453186878680 |
10 | 2121212201103 |
11 | 748667a955a6 |
12 | 2a3131811153 |
13 | 12504c9255a8 |
14 | 7494abc0619 |
15 | 3a29e5cdca3 |
hex | 1ede219888f |
2121212201103 has 6 divisors (see below), whose sum is σ = 3063973179384. Its totient is φ = 1414141467396.
The previous prime is 2121212201047. The next prime is 2121212201123. The reversal of 2121212201103 is 3011022121212.
2121212201103 is a `hidden beast` number, since 212 + 121 + 220 + 110 + 3 = 666.
It is not a de Polignac number, because 2121212201103 - 214 = 2121212184719 is a prime.
It is a super-2 number, since 2×21212122011032 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2121212201123) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 117845122275 + ... + 117845122292.
It is an arithmetic number, because the mean of its divisors is an integer number (510662196564).
Almost surely, 22121212201103 is an apocalyptic number.
2121212201103 is a deficient number, since it is larger than the sum of its proper divisors (942760978281).
2121212201103 is a wasteful number, since it uses less digits than its factorization.
2121212201103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235690244573 (or 235690244570 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 2121212201103 its reverse (3011022121212), we get a palindrome (5132234322315).
The spelling of 2121212201103 in words is "two trillion, one hundred twenty-one billion, two hundred twelve million, two hundred one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •