Base | Representation |
---|---|
bin | 1011000110111001101110… |
… | …1000011110011010010011 |
3 | 1121020120102010022211101212 |
4 | 2301232123220132122103 |
5 | 3100100114443220311 |
6 | 41550400144250335 |
7 | 2400242362326221 |
oct | 261563350363223 |
9 | 47216363284355 |
10 | 12213203101331 |
11 | 39896548314a1 |
12 | 14530010109ab |
13 | 6a79141b254b |
14 | 30319d3b7b11 |
15 | 162a60564c8b |
hex | b1b9ba1e693 |
12213203101331 has 16 divisors (see below), whose sum is σ = 13070352256416. Its totient is φ = 11371566022656.
The previous prime is 12213203101277. The next prime is 12213203101367. The reversal of 12213203101331 is 13310130231221.
It is a cyclic number.
It is not a de Polignac number, because 12213203101331 - 222 = 12213198907027 is a prime.
It is a super-2 number, since 2×122132031013312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12213203101297 and 12213203101306.
It is not an unprimeable number, because it can be changed into a prime (12213203101831) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2453480 + ... + 5517786.
It is an arithmetic number, because the mean of its divisors is an integer number (816897016026).
Almost surely, 212213203101331 is an apocalyptic number.
12213203101331 is a deficient number, since it is larger than the sum of its proper divisors (857149155085).
12213203101331 is a wasteful number, since it uses less digits than its factorization.
12213203101331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3066838.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 12213203101331 its reverse (13310130231221), we get a palindrome (25523333332552).
The spelling of 12213203101331 in words is "twelve trillion, two hundred thirteen billion, two hundred three million, one hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •