Base | Representation |
---|---|
bin | 11110100101101101001… |
… | …01001010000100101001 |
3 | 10201110220110011220220122 |
4 | 33102312211022010221 |
5 | 114210010003322441 |
6 | 2122501112133025 |
7 | 135635426625524 |
oct | 17226645120451 |
9 | 3643813156818 |
10 | 1051035214121 |
11 | 375817a83702 |
12 | 14b845697175 |
13 | 7815c654aa9 |
14 | 38c2844dbbb |
15 | 1c516e4634b |
hex | f4b694a129 |
1051035214121 has 2 divisors, whose sum is σ = 1051035214122. Its totient is φ = 1051035214120.
The previous prime is 1051035214111. The next prime is 1051035214123. The reversal of 1051035214121 is 1214125301501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 794807910400 + 256227303721 = 891520^2 + 506189^2 .
It is a cyclic number.
It is not a de Polignac number, because 1051035214121 - 210 = 1051035213097 is a prime.
It is a super-2 number, since 2×10510352141212 (a number of 25 digits) contains 22 as substring.
Together with 1051035214123, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1051035214123) 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, 525517607060 + 525517607061.
It is an arithmetic number, because the mean of its divisors is an integer number (525517607061).
Almost surely, 21051035214121 is an apocalyptic number.
It is an amenable number.
1051035214121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1051035214121 is an equidigital number, since it uses as much as digits as its factorization.
1051035214121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1200, while the sum is 26.
The spelling of 1051035214121 in words is "one trillion, fifty-one billion, thirty-five million, two hundred fourteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •