Base | Representation |
---|---|
bin | 10001101000111110100… |
… | …111001000110000000001 |
3 | 11021212222110220200110122 |
4 | 101220332213020300001 |
5 | 124330122143134241 |
6 | 2324520310110025 |
7 | 153403135252115 |
oct | 21507647106001 |
9 | 4255873820418 |
10 | 1212231224321 |
11 | 428116a17a47 |
12 | 176b3194b315 |
13 | 8a40b619b50 |
14 | 4295ab35745 |
15 | 217ed8d204b |
hex | 11a3e9c8c01 |
1212231224321 has 16 divisors (see below), whose sum is σ = 1314899140800. Its totient is φ = 1110916451520.
The previous prime is 1212231224317. The next prime is 1212231224327. The reversal of 1212231224321 is 1234221322121.
It is a cyclic number.
It is not a de Polignac number, because 1212231224321 - 22 = 1212231224317 is a prime.
It is a super-2 number, since 2×12122312243212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1212231224327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3739706 + ... + 4050908.
It is an arithmetic number, because the mean of its divisors is an integer number (82181196300).
Almost surely, 21212231224321 is an apocalyptic number.
It is an amenable number.
1212231224321 is a deficient number, since it is larger than the sum of its proper divisors (102667916479).
1212231224321 is a wasteful number, since it uses less digits than its factorization.
1212231224321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 313376.
The product of its digits is 2304, while the sum is 26.
Adding to 1212231224321 its reverse (1234221322121), we get a palindrome (2446452546442).
The spelling of 1212231224321 in words is "one trillion, two hundred twelve billion, two hundred thirty-one million, two hundred twenty-four thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •