Base | Representation |
---|---|
bin | 10001110011001101100… |
… | …101111111100100001001 |
3 | 11022221100022020101020201 |
4 | 101303031211333210021 |
5 | 130020123310013113 |
6 | 2333534533452201 |
7 | 154242350312032 |
oct | 21631545774411 |
9 | 4287308211221 |
10 | 1223220001033 |
11 | 43184588a598 |
12 | 179099aa1061 |
13 | 8b470114ba4 |
14 | 432c0323a89 |
15 | 21c434a5cdd |
hex | 11ccd97f909 |
1223220001033 has 16 divisors (see below), whose sum is σ = 1248402586896. Its totient is φ = 1198116541440.
The previous prime is 1223220000953. The next prime is 1223220001037. The reversal of 1223220001033 is 3301000223221.
It can be written as a sum of positive squares in 8 ways, for example, as 71959672009 + 1151260329024 = 268253^2 + 1072968^2 .
It is not a de Polignac number, because 1223220001033 - 29 = 1223220000521 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1223220001033.
It is not an unprimeable number, because it can be changed into a prime (1223220001037) 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, 192296773 + ... + 192303133.
It is an arithmetic number, because the mean of its divisors is an integer number (78025161681).
Almost surely, 21223220001033 is an apocalyptic number.
It is an amenable number.
1223220001033 is a deficient number, since it is larger than the sum of its proper divisors (25182585863).
1223220001033 is an equidigital number, since it uses as much as digits as its factorization.
1223220001033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11964.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 1223220001033 its reverse (3301000223221), we get a palindrome (4524220224254).
The spelling of 1223220001033 in words is "one trillion, two hundred twenty-three billion, two hundred twenty million, one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •