Base | Representation |
---|---|
bin | 10001110011000110100… |
… | …001010001000000011001 |
3 | 11022221001000220211011212 |
4 | 101303012201101000121 |
5 | 130014402414234431 |
6 | 2333515054032505 |
7 | 154236406456562 |
oct | 21630641210031 |
9 | 4287030824155 |
10 | 1223101321241 |
11 | 43179489a718 |
12 | 1790661a8735 |
13 | 8b451660b67 |
14 | 432ac66d169 |
15 | 21c37d6172b |
hex | 11cc6851019 |
1223101321241 has 8 divisors (see below), whose sum is σ = 1265450277000. Its totient is φ = 1180763902080.
The previous prime is 1223101321219. The next prime is 1223101321361. The reversal of 1223101321241 is 1421231013221.
It can be written as a sum of positive squares in 4 ways, for example, as 99969792400 + 1123131528841 = 316180^2 + 1059779^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1223101321241 - 26 = 1223101321177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1223101321201) 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, 2668166 + ... + 3092783.
It is an arithmetic number, because the mean of its divisors is an integer number (158181284625).
Almost surely, 21223101321241 is an apocalyptic number.
It is an amenable number.
1223101321241 is a deficient number, since it is larger than the sum of its proper divisors (42348955759).
1223101321241 is an equidigital number, since it uses as much as digits as its factorization.
1223101321241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5768299.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 1223101321241 its reverse (1421231013221), we get a palindrome (2644332334462).
The spelling of 1223101321241 in words is "one trillion, two hundred twenty-three billion, one hundred one million, three hundred twenty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •