Base | Representation |
---|---|
bin | 1001000111010111010001… |
… | …1100000101011110000001 |
3 | 1022111002211020021110122122 |
4 | 2101311310130011132001 |
5 | 2303200241212033212 |
6 | 33152032250414025 |
7 | 2053034166205136 |
oct | 221656434053601 |
9 | 38432736243578 |
10 | 10022112221057 |
11 | 3214399088a82 |
12 | 115a429131315 |
13 | 57910930c7b1 |
14 | 269103b6258d |
15 | 125a7133c272 |
hex | 91d74705781 |
10022112221057 has 2 divisors, whose sum is σ = 10022112221058. Its totient is φ = 10022112221056.
The previous prime is 10022112220997. The next prime is 10022112221083. The reversal of 10022112221057 is 75012221122001.
It is an a-pointer prime, because the next prime (10022112221083) can be obtained adding 10022112221057 to its sum of digits (26).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6653918271361 + 3368193949696 = 2579519^2 + 1835264^2 .
It is a cyclic number.
It is not a de Polignac number, because 10022112221057 - 26 = 10022112220993 is a prime.
It is not a weakly prime, because it can be changed into another prime (10022112221087) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5011056110528 + 5011056110529.
It is an arithmetic number, because the mean of its divisors is an integer number (5011056110529).
Almost surely, 210022112221057 is an apocalyptic number.
It is an amenable number.
10022112221057 is a deficient number, since it is larger than the sum of its proper divisors (1).
10022112221057 is an equidigital number, since it uses as much as digits as its factorization.
10022112221057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1120, while the sum is 26.
Adding to 10022112221057 its reverse (75012221122001), we get a palindrome (85034333343058).
The spelling of 10022112221057 in words is "ten trillion, twenty-two billion, one hundred twelve million, two hundred twenty-one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •