Base | Representation |
---|---|
bin | 1010010010100000101010… |
… | …0000011001010010111001 |
3 | 1111001112010210101221222111 |
4 | 2210220022200121102321 |
5 | 2440323232222401131 |
6 | 40021101534252321 |
7 | 2245226443253443 |
oct | 244501240312271 |
9 | 44045123357874 |
10 | 11313120122041 |
11 | 367195a416081 |
12 | 13286850570a1 |
13 | 640a90491c8a |
14 | 2b17b4d91493 |
15 | 149430ae6ab1 |
hex | a4a0a8194b9 |
11313120122041 has 2 divisors, whose sum is σ = 11313120122042. Its totient is φ = 11313120122040.
The previous prime is 11313120122023. The next prime is 11313120122107. The reversal of 11313120122041 is 14022102131311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10566660409600 + 746459712441 = 3250640^2 + 863979^2 .
It is a cyclic number.
It is not a de Polignac number, because 11313120122041 - 211 = 11313120119993 is a prime.
It is not a weakly prime, because it can be changed into another prime (11313120122341) 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, 5656560061020 + 5656560061021.
It is an arithmetic number, because the mean of its divisors is an integer number (5656560061021).
Almost surely, 211313120122041 is an apocalyptic number.
It is an amenable number.
11313120122041 is a deficient number, since it is larger than the sum of its proper divisors (1).
11313120122041 is an equidigital number, since it uses as much as digits as its factorization.
11313120122041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 11313120122041 its reverse (14022102131311), we get a palindrome (25335222253352).
The spelling of 11313120122041 in words is "eleven trillion, three hundred thirteen billion, one hundred twenty million, one hundred twenty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •