Base | Representation |
---|---|
bin | 100000011101111001001… |
… | …111011101010101110111 |
3 | 21220021220201220010222111 |
4 | 200131321033131111313 |
5 | 243023314230401403 |
6 | 4424544030111451 |
7 | 320123200061650 |
oct | 40357117352567 |
9 | 7807821803874 |
10 | 2231122122103 |
11 | 7902392aaa56 |
12 | 3004a634b587 |
13 | 1325175735c4 |
14 | 79db6036527 |
15 | 3d08383156d |
hex | 207793dd577 |
2231122122103 has 8 divisors (see below), whose sum is σ = 2604106063872. Its totient is φ = 1871701232856.
The previous prime is 2231122122101. The next prime is 2231122122211. The reversal of 2231122122103 is 3012212211322.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2231122122103 - 21 = 2231122122101 is a prime.
It is a super-3 number, since 3×22311221221033 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2231122122101) 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, 3390762775 + ... + 3390763432.
It is an arithmetic number, because the mean of its divisors is an integer number (325513257984).
Almost surely, 22231122122103 is an apocalyptic number.
2231122122103 is a deficient number, since it is larger than the sum of its proper divisors (372983941769).
2231122122103 is an equidigital number, since it uses as much as digits as its factorization.
2231122122103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6781526261.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 2231122122103 its reverse (3012212211322), we get a palindrome (5243334333425).
The spelling of 2231122122103 in words is "two trillion, two hundred thirty-one billion, one hundred twenty-two million, one hundred twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.450 sec. • engine limits •