Base | Representation |
---|---|
bin | 1001010010010111010011… |
… | …0111010101010101011001 |
3 | 1100011011121222012221100022 |
4 | 2110211310313111111121 |
5 | 2314244312032044303 |
6 | 33414525202120225 |
7 | 2102504345164532 |
oct | 224456467252531 |
9 | 40134558187308 |
10 | 10211097924953 |
11 | 3287558637522 |
12 | 118ab90050075 |
13 | 590b9676a1a3 |
14 | 2743110d1689 |
15 | 12a93284b438 |
hex | 94974dd5559 |
10211097924953 has 2 divisors, whose sum is σ = 10211097924954. Its totient is φ = 10211097924952.
The previous prime is 10211097924949. The next prime is 10211097924959. The reversal of 10211097924953 is 35942979011201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10051639066624 + 159458858329 = 3170432^2 + 399323^2 .
It is a cyclic number.
It is not a de Polignac number, because 10211097924953 - 22 = 10211097924949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10211097924895 and 10211097924904.
It is not a weakly prime, because it can be changed into another prime (10211097924959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105548962476 + 5105548962477.
It is an arithmetic number, because the mean of its divisors is an integer number (5105548962477).
Almost surely, 210211097924953 is an apocalyptic number.
It is an amenable number.
10211097924953 is a deficient number, since it is larger than the sum of its proper divisors (1).
10211097924953 is an equidigital number, since it uses as much as digits as its factorization.
10211097924953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1224720, while the sum is 53.
The spelling of 10211097924953 in words is "ten trillion, two hundred eleven billion, ninety-seven million, nine hundred twenty-four thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •