Base | Representation |
---|---|
bin | 100000011101110011110… |
… | …001010001000000111011 |
3 | 21220021200100011011211110 |
4 | 200131303301101000323 |
5 | 243023122230234321 |
6 | 4424530550331403 |
7 | 320121003555606 |
oct | 40356361210073 |
9 | 7807610134743 |
10 | 2231030321211 |
11 | 7901a14a964a |
12 | 30047b659b63 |
13 | 132501540a53 |
14 | 79da7b7b33d |
15 | 3d07a74b176 |
hex | 20773c5103b |
2231030321211 has 8 divisors (see below), whose sum is σ = 2974833241600. Its totient is φ = 1487290474152.
The previous prime is 2231030321171. The next prime is 2231030321237. The reversal of 2231030321211 is 1121230301322.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2231030321211 - 27 = 2231030321083 is a prime.
It is a super-3 number, since 3×22310303212113 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2231030321251) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 15685735 + ... + 15827328.
It is an arithmetic number, because the mean of its divisors is an integer number (371854155200).
Almost surely, 22231030321211 is an apocalyptic number.
2231030321211 is a deficient number, since it is larger than the sum of its proper divisors (743802920389).
2231030321211 is a wasteful number, since it uses less digits than its factorization.
2231030321211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31536665.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 2231030321211 its reverse (1121230301322), we get a palindrome (3352260622533).
The spelling of 2231030321211 in words is "two trillion, two hundred thirty-one billion, thirty million, three hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •