Base | Representation |
---|---|
bin | 11110111000011110110… |
… | …101001011001100110101 |
3 | 21111212211221020002120202 |
4 | 132320132311023030311 |
5 | 234232312130201323 |
6 | 4302534533410245 |
7 | 306216602466560 |
oct | 36703665131465 |
9 | 7455757202522 |
10 | 2122231100213 |
11 | 749040147584 |
12 | 2a3376a99985 |
13 | 125182a4ba83 |
14 | 74a0624b4d7 |
15 | 3a30dc94d28 |
hex | 1ee1ed4b335 |
2122231100213 has 8 divisors (see below), whose sum is σ = 2430881934528. Its totient is φ = 1814949006624.
The previous prime is 2122231100179. The next prime is 2122231100321. The reversal of 2122231100213 is 3120011322212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2122231100213 is a prime.
It is a super-2 number, since 2×21222311002132 (a number of 25 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 (2122231100113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 342181856 + ... + 342188057.
It is an arithmetic number, because the mean of its divisors is an integer number (303860241816).
Almost surely, 22122231100213 is an apocalyptic number.
It is an amenable number.
2122231100213 is a deficient number, since it is larger than the sum of its proper divisors (308650834315).
2122231100213 is an equidigital number, since it uses as much as digits as its factorization.
2122231100213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 684370363.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 2122231100213 its reverse (3120011322212), we get a palindrome (5242242422425).
The spelling of 2122231100213 in words is "two trillion, one hundred twenty-two billion, two hundred thirty-one million, one hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •