Base | Representation |
---|---|
bin | 1001010010011010101101… |
… | …0010100001000101110101 |
3 | 1100011020222121101000011212 |
4 | 2110212223102201011311 |
5 | 2314303144310130121 |
6 | 33415155541011205 |
7 | 2102536103315252 |
oct | 224465322410565 |
9 | 40136877330155 |
10 | 10212011020661 |
11 | 3287986aa387a |
12 | 118b1a59b3b05 |
13 | 590cb099a4c8 |
14 | 27439a49a429 |
15 | 12a987ab325b |
hex | 949ab4a1175 |
10212011020661 has 2 divisors, whose sum is σ = 10212011020662. Its totient is φ = 10212011020660.
The previous prime is 10212011020637. The next prime is 10212011020667. The reversal of 10212011020661 is 16602011021201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9186469984561 + 1025541036100 = 3030919^2 + 1012690^2 .
It is a cyclic number.
It is not a de Polignac number, because 10212011020661 - 26 = 10212011020597 is a prime.
It is a super-2 number, since 2×102120110206612 (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 (10212011020667) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5106005510330 + 5106005510331.
It is an arithmetic number, because the mean of its divisors is an integer number (5106005510331).
Almost surely, 210212011020661 is an apocalyptic number.
It is an amenable number.
10212011020661 is a deficient number, since it is larger than the sum of its proper divisors (1).
10212011020661 is an equidigital number, since it uses as much as digits as its factorization.
10212011020661 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 23.
Adding to 10212011020661 its reverse (16602011021201), we get a palindrome (26814022041862).
The spelling of 10212011020661 in words is "ten trillion, two hundred twelve billion, eleven million, twenty thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •