Base | Representation |
---|---|
bin | 1010000111010110001010… |
… | …0111000010110000000001 |
3 | 1110101012002020112121122112 |
4 | 2201311202213002300001 |
5 | 2424202433112401033 |
6 | 35353022133345105 |
7 | 2225326536322352 |
oct | 241654247026001 |
9 | 43335066477575 |
10 | 11121324731393 |
11 | 35a8588973368 |
12 | 12b7479198195 |
13 | 628975bc5246 |
14 | 2a63bc7d9d29 |
15 | 144457ad7c48 |
hex | a1d629c2c01 |
11121324731393 has 2 divisors, whose sum is σ = 11121324731394. Its totient is φ = 11121324731392.
The previous prime is 11121324731389. The next prime is 11121324731399. The reversal of 11121324731393 is 39313742312111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11038122482689 + 83202248704 = 3322367^2 + 288448^2 .
It is a cyclic number.
It is not a de Polignac number, because 11121324731393 - 22 = 11121324731389 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11121324731393.
It is not a weakly prime, because it can be changed into another prime (11121324731399) 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, 5560662365696 + 5560662365697.
It is an arithmetic number, because the mean of its divisors is an integer number (5560662365697).
Almost surely, 211121324731393 is an apocalyptic number.
It is an amenable number.
11121324731393 is a deficient number, since it is larger than the sum of its proper divisors (1).
11121324731393 is an equidigital number, since it uses as much as digits as its factorization.
11121324731393 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 81648, while the sum is 41.
The spelling of 11121324731393 in words is "eleven trillion, one hundred twenty-one billion, three hundred twenty-four million, seven hundred thirty-one thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •