Base | Representation |
---|---|
bin | 10110101111111100… |
… | …00011011110101101 |
3 | 1011112011111002100110 |
4 | 23113332003132231 |
5 | 200003101200323 |
6 | 5335525250233 |
7 | 611441235666 |
oct | 132776033655 |
9 | 34464432313 |
10 | 12213303213 |
11 | 51a8100521 |
12 | 244a263979 |
13 | 11c83c9047 |
14 | 83c0a436d |
15 | 4b7356793 |
hex | 2d7f837ad |
12213303213 has 8 divisors (see below), whose sum is σ = 16809707776. Its totient is φ = 7879550400.
The previous prime is 12213303203. The next prime is 12213303229. The reversal of 12213303213 is 31230331221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12213303213 - 24 = 12213303197 is a prime.
It is a super-2 number, since 2×122133032132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 12213303213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12213303203) 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, 65662828 + ... + 65663013.
It is an arithmetic number, because the mean of its divisors is an integer number (2101213472).
Almost surely, 212213303213 is an apocalyptic number.
It is an amenable number.
12213303213 is a deficient number, since it is larger than the sum of its proper divisors (4596404563).
12213303213 is a wasteful number, since it uses less digits than its factorization.
12213303213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131325875.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 12213303213 its reverse (31230331221), we get a palindrome (43443634434).
The spelling of 12213303213 in words is "twelve billion, two hundred thirteen million, three hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •