Base | Representation |
---|---|
bin | 1001000111010111010011… |
… | …1010001001100010100101 |
3 | 1022111002211210002212100101 |
4 | 2101311310322021202211 |
5 | 2303200300221231203 |
6 | 33152033131344101 |
7 | 2053034323200613 |
oct | 221656472114245 |
9 | 38432753085311 |
10 | 10022120102053 |
11 | 32143a25810a4 |
12 | 115a42b8b2031 |
13 | 57910ab3b9c7 |
14 | 269104c146b3 |
15 | 125a71d9741d |
hex | 91d74e898a5 |
10022120102053 has 2 divisors, whose sum is σ = 10022120102054. Its totient is φ = 10022120102052.
The previous prime is 10022120101997. The next prime is 10022120102077. The reversal of 10022120102053 is 35020102122001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9643055776929 + 379064325124 = 3105327^2 + 615682^2 .
It is a cyclic number.
It is not a de Polignac number, because 10022120102053 - 225 = 10022086547621 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10022120102053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10022120142053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5011060051026 + 5011060051027.
It is an arithmetic number, because the mean of its divisors is an integer number (5011060051027).
Almost surely, 210022120102053 is an apocalyptic number.
It is an amenable number.
10022120102053 is a deficient number, since it is larger than the sum of its proper divisors (1).
10022120102053 is an equidigital number, since it uses as much as digits as its factorization.
10022120102053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 240, while the sum is 19.
Adding to 10022120102053 its reverse (35020102122001), we get a palindrome (45042222224054).
The spelling of 10022120102053 in words is "ten trillion, twenty-two billion, one hundred twenty million, one hundred two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •