Base | Representation |
---|---|
bin | 10001110011001100011… |
… | …010100000100010000001 |
3 | 11022221021221000001100002 |
4 | 101303030122200202001 |
5 | 130020103223304441 |
6 | 2333532545405345 |
7 | 154242020155235 |
oct | 21631432404201 |
9 | 4287257001302 |
10 | 1223200213121 |
11 | 4318356a4647 |
12 | 179093339855 |
13 | 8b468ca7173 |
14 | 432bb8525c5 |
15 | 21c41897b9b |
hex | 11ccc6a0881 |
1223200213121 has 12 divisors (see below), whose sum is σ = 1341301370880. Its totient is φ = 1114110242880.
The previous prime is 1223200213093. The next prime is 1223200213217. The reversal of 1223200213121 is 1213120023221.
It is not a de Polignac number, because 1223200213121 - 230 = 1222126471297 is a prime.
It is a super-2 number, since 2×12232002131212 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1223200213093 and 1223200213102.
It is not an unprimeable number, because it can be changed into a prime (1223200213021) 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, 68257601 + ... + 68275518.
It is an arithmetic number, because the mean of its divisors is an integer number (111775114240).
Almost surely, 21223200213121 is an apocalyptic number.
It is an amenable number.
1223200213121 is a deficient number, since it is larger than the sum of its proper divisors (118101157759).
1223200213121 is a wasteful number, since it uses less digits than its factorization.
1223200213121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136533184 (or 136533167 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 1223200213121 its reverse (1213120023221), we get a palindrome (2436320236342).
The spelling of 1223200213121 in words is "one trillion, two hundred twenty-three billion, two hundred million, two hundred thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •