Base | Representation |
---|---|
bin | 1011000110111010001010… |
… | …1010010011011100100011 |
3 | 1121020120201100012210002010 |
4 | 2301232202222103130203 |
5 | 3100100340140134334 |
6 | 41550415555524003 |
7 | 2400245323535043 |
oct | 261564252233443 |
9 | 47216640183063 |
10 | 12213321021219 |
11 | 398970535244a |
12 | 14530345b9603 |
13 | 6a793275b726 |
14 | 3031b0d11723 |
15 | 162a6aaa90e9 |
hex | b1ba2a93723 |
12213321021219 has 12 divisors (see below), whose sum is σ = 17298683062424. Its totient is φ = 7663260248064.
The previous prime is 12213321021211. The next prime is 12213321021227. The reversal of 12213321021219 is 91212012331221.
12213321021219 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (12213321021211) and next prime (12213321021227).
It is not a de Polignac number, because 12213321021219 - 23 = 12213321021211 is a prime.
It is a super-2 number, since 2×122133210212192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12213321021211) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7043436862 + ... + 7043438595.
Almost surely, 212213321021219 is an apocalyptic number.
12213321021219 is a deficient number, since it is larger than the sum of its proper divisors (5085362041205).
12213321021219 is a wasteful number, since it uses less digits than its factorization.
12213321021219 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14086875494 (or 14086875477 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 30.
The spelling of 12213321021219 in words is "twelve trillion, two hundred thirteen billion, three hundred twenty-one million, twenty-one thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •