Base | Representation |
---|---|
bin | 11101100001000110010… |
… | …01110000111101010001 |
3 | 10120221211111002000122121 |
4 | 32300203021300331101 |
5 | 113104041210403431 |
6 | 2053530141334241 |
7 | 133162605064561 |
oct | 16604311607521 |
9 | 3527744060577 |
10 | 1014202044241 |
11 | 361136682a41 |
12 | 144686267381 |
13 | 7483c6c9309 |
14 | 371326b4da1 |
15 | 1b5ad4a9611 |
hex | ec23270f51 |
1014202044241 has 2 divisors, whose sum is σ = 1014202044242. Its totient is φ = 1014202044240.
The previous prime is 1014202044239. The next prime is 1014202044269. The reversal of 1014202044241 is 1424402024101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 743037104016 + 271164940225 = 861996^2 + 520735^2 .
It is a cyclic number.
It is not a de Polignac number, because 1014202044241 - 21 = 1014202044239 is a prime.
Together with 1014202044239, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1014202044041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 507101022120 + 507101022121.
It is an arithmetic number, because the mean of its divisors is an integer number (507101022121).
Almost surely, 21014202044241 is an apocalyptic number.
It is an amenable number.
1014202044241 is a deficient number, since it is larger than the sum of its proper divisors (1).
1014202044241 is an equidigital number, since it uses as much as digits as its factorization.
1014202044241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2048, while the sum is 25.
Adding to 1014202044241 its reverse (1424402024101), we get a palindrome (2438604068342).
The spelling of 1014202044241 in words is "one trillion, fourteen billion, two hundred two million, forty-four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •