Base | Representation |
---|---|
bin | 1001000110001001000101… |
… | …0010100000001111011001 |
3 | 1022102002122100100212222021 |
4 | 2101202101102200033121 |
5 | 2302324244040141212 |
6 | 33134241324454441 |
7 | 2051362053240226 |
oct | 221422122401731 |
9 | 38362570325867 |
10 | 10001121412057 |
11 | 32064a7343546 |
12 | 115634b3aa421 |
13 | 577142595259 |
14 | 2680b204294d |
15 | 125243608307 |
hex | 918914a03d9 |
10001121412057 has 2 divisors, whose sum is σ = 10001121412058. Its totient is φ = 10001121412056.
The previous prime is 10001121411949. The next prime is 10001121412133. The reversal of 10001121412057 is 75021412110001.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6978874763536 + 3022246648521 = 2641756^2 + 1738461^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10001121412057 is a prime.
It is not a weakly prime, because it can be changed into another prime (10001121412757) 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, 5000560706028 + 5000560706029.
It is an arithmetic number, because the mean of its divisors is an integer number (5000560706029).
Almost surely, 210001121412057 is an apocalyptic number.
It is an amenable number.
10001121412057 is a deficient number, since it is larger than the sum of its proper divisors (1).
10001121412057 is an equidigital number, since it uses as much as digits as its factorization.
10001121412057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 560, while the sum is 25.
Adding to 10001121412057 its reverse (75021412110001), we get a palindrome (85022533522058).
The spelling of 10001121412057 in words is "ten trillion, one billion, one hundred twenty-one million, four hundred twelve thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •