Base | Representation |
---|---|
bin | 10000001101111001110… |
… | …111110100001000010001 |
3 | 10221112120022201221202002 |
4 | 100031321313310020101 |
5 | 121224333422013431 |
6 | 2211544530403345 |
7 | 143341614636551 |
oct | 20157167641021 |
9 | 3845508657662 |
10 | 1114441204241 |
11 | 39a6a5008532 |
12 | 15bba0130555 |
13 | 81125924441 |
14 | 3bd213cd161 |
15 | 1dec86d63cb |
hex | 10379df4211 |
1114441204241 has 2 divisors, whose sum is σ = 1114441204242. Its totient is φ = 1114441204240.
The previous prime is 1114441204211. The next prime is 1114441204259. The reversal of 1114441204241 is 1424021444111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1051086300625 + 63354903616 = 1025225^2 + 251704^2 .
It is a cyclic number.
It is not a de Polignac number, because 1114441204241 - 214 = 1114441187857 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1114441204211) 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, 557220602120 + 557220602121.
It is an arithmetic number, because the mean of its divisors is an integer number (557220602121).
Almost surely, 21114441204241 is an apocalyptic number.
It is an amenable number.
1114441204241 is a deficient number, since it is larger than the sum of its proper divisors (1).
1114441204241 is an equidigital number, since it uses as much as digits as its factorization.
1114441204241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4096, while the sum is 29.
Adding to 1114441204241 its reverse (1424021444111), we get a palindrome (2538462648352).
The spelling of 1114441204241 in words is "one trillion, one hundred fourteen billion, four hundred forty-one million, two hundred four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •