Base | Representation |
---|---|
bin | 11111001110000111000… |
… | …01100011101110101001 |
3 | 10210112220012111112102112 |
4 | 33213003201203232221 |
5 | 120033421131222141 |
6 | 2140445403012105 |
7 | 140334115562642 |
oct | 17470341435651 |
9 | 3715805445375 |
10 | 1072727210921 |
11 | 383a395a9993 |
12 | 153a9a20a035 |
13 | 7a208736262 |
14 | 39cc53366c9 |
15 | 1cd864d47eb |
hex | f9c3863ba9 |
1072727210921 has 2 divisors, whose sum is σ = 1072727210922. Its totient is φ = 1072727210920.
The previous prime is 1072727210783. The next prime is 1072727210923. The reversal of 1072727210921 is 1290127272701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 560006768896 + 512720442025 = 748336^2 + 716045^2 .
It is an emirp because it is prime and its reverse (1290127272701) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1072727210921 is a prime.
Together with 1072727210923, it forms a pair of twin primes.
It is a Chen prime.
It is an alternating number because its digits alternate between odd and even.
It is not a weakly prime, because it can be changed into another prime (1072727210923) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 536363605460 + 536363605461.
It is an arithmetic number, because the mean of its divisors is an integer number (536363605461).
Almost surely, 21072727210921 is an apocalyptic number.
It is an amenable number.
1072727210921 is a deficient number, since it is larger than the sum of its proper divisors (1).
1072727210921 is an equidigital number, since it uses as much as digits as its factorization.
1072727210921 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 49392, while the sum is 41.
The spelling of 1072727210921 in words is "one trillion, seventy-two billion, seven hundred twenty-seven million, two hundred ten thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.228 sec. • engine limits •