Base | Representation |
---|---|
bin | 1101010111111100011101000… |
… | …0000110000101000000101011 |
3 | 11120102020021212000220022222102 |
4 | 3111333013100012011000223 |
5 | 1441323311322122334011 |
6 | 13133333010020444015 |
7 | 402142515132661433 |
oct | 32577072006050053 |
9 | 4512207760808872 |
10 | 941121020121131 |
11 | 25296320197a663 |
12 | 8967768554960b |
13 | 315194400c2855 |
14 | 128587011d72c3 |
15 | 73c0ab67bd73b |
hex | 357f1d018502b |
941121020121131 has 2 divisors, whose sum is σ = 941121020121132. Its totient is φ = 941121020121130.
The previous prime is 941121020121103. The next prime is 941121020121151. The reversal of 941121020121131 is 131121020121149.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-941121020121131 is a prime.
It is a super-2 number, since 2×9411210201211312 (a number of 31 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 941121020121094 and 941121020121103.
It is not a weakly prime, because it can be changed into another prime (941121020121151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 470560510060565 + 470560510060566.
It is an arithmetic number, because the mean of its divisors is an integer number (470560510060566).
Almost surely, 2941121020121131 is an apocalyptic number.
941121020121131 is a deficient number, since it is larger than the sum of its proper divisors (1).
941121020121131 is an equidigital number, since it uses as much as digits as its factorization.
941121020121131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 29.
The spelling of 941121020121131 in words is "nine hundred forty-one trillion, one hundred twenty-one billion, twenty million, one hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •