Base | Representation |
---|---|
bin | 10001100000100100010… |
… | …101110110010101100001 |
3 | 11021000200010002220112021 |
4 | 101200210111312111201 |
5 | 124203123320101431 |
6 | 2320424231301441 |
7 | 152633300634214 |
oct | 21404425662541 |
9 | 4230603086467 |
10 | 1203200550241 |
11 | 424302385938 |
12 | 17523151a881 |
13 | 895cc6b9b11 |
14 | 4234161777b |
15 | 21470b96b11 |
hex | 11824576561 |
1203200550241 has 2 divisors, whose sum is σ = 1203200550242. Its totient is φ = 1203200550240.
The previous prime is 1203200550239. The next prime is 1203200550257. The reversal of 1203200550241 is 1420550023021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1130904633600 + 72295916641 = 1063440^2 + 268879^2 .
It is a cyclic number.
It is not a de Polignac number, because 1203200550241 - 21 = 1203200550239 is a prime.
Together with 1203200550239, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1203200550221) 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 as a sum of consecutive naturals, namely, 601600275120 + 601600275121.
It is an arithmetic number, because the mean of its divisors is an integer number (601600275121).
Almost surely, 21203200550241 is an apocalyptic number.
It is an amenable number.
1203200550241 is a deficient number, since it is larger than the sum of its proper divisors (1).
1203200550241 is an equidigital number, since it uses as much as digits as its factorization.
1203200550241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2400, while the sum is 25.
Adding to 1203200550241 its reverse (1420550023021), we get a palindrome (2623750573262).
The spelling of 1203200550241 in words is "one trillion, two hundred three billion, two hundred million, five hundred fifty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •