Base | Representation |
---|---|
bin | 1001010010010111010111… |
… | …0010001000110010010101 |
3 | 1100011011200001020002212221 |
4 | 2110211311302020302111 |
5 | 2314244330003340203 |
6 | 33414530512342341 |
7 | 2102504623206523 |
oct | 224456562106225 |
9 | 40134601202787 |
10 | 10211113340053 |
11 | 328756630607a |
12 | 118ab952449b1 |
13 | 590b99a06752 |
14 | 274313185313 |
15 | 12a933d93abd |
hex | 94975c88c95 |
10211113340053 has 2 divisors, whose sum is σ = 10211113340054. Its totient is φ = 10211113340052.
The previous prime is 10211113340003. The next prime is 10211113340059. The reversal of 10211113340053 is 35004331111201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6768541096164 + 3442572243889 = 2601642^2 + 1855417^2 .
It is a cyclic number.
It is not a de Polignac number, because 10211113340053 - 29 = 10211113339541 is a prime.
It is a super-2 number, since 2×102111133400532 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10211113340059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105556670026 + 5105556670027.
It is an arithmetic number, because the mean of its divisors is an integer number (5105556670027).
Almost surely, 210211113340053 is an apocalyptic number.
It is an amenable number.
10211113340053 is a deficient number, since it is larger than the sum of its proper divisors (1).
10211113340053 is an equidigital number, since it uses as much as digits as its factorization.
10211113340053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 10211113340053 its reverse (35004331111201), we get a palindrome (45215444451254).
The spelling of 10211113340053 in words is "ten trillion, two hundred eleven billion, one hundred thirteen million, three hundred forty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •