Base | Representation |
---|---|
bin | 1001010010011011011100… |
… | …1101011101011100100001 |
3 | 1100011021111112201002220002 |
4 | 2110212313031131130201 |
5 | 2314304102010142401 |
6 | 33415231443425345 |
7 | 2102544052305341 |
oct | 224466715353441 |
9 | 40137445632802 |
10 | 10212211021601 |
11 | 3287a79987506 |
12 | 118b240985255 |
13 | 591013255064 |
14 | 2743b8c7cd21 |
15 | 12a99a41ca6b |
hex | 949b735d721 |
10212211021601 has 2 divisors, whose sum is σ = 10212211021602. Its totient is φ = 10212211021600.
The previous prime is 10212211021577. The next prime is 10212211021669. The reversal of 10212211021601 is 10612011221201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9991137087376 + 221073934225 = 3160876^2 + 470185^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10212211021601 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (10212211021801) 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, 5106105510800 + 5106105510801.
It is an arithmetic number, because the mean of its divisors is an integer number (5106105510801).
Almost surely, 210212211021601 is an apocalyptic number.
It is an amenable number.
10212211021601 is a deficient number, since it is larger than the sum of its proper divisors (1).
10212211021601 is an equidigital number, since it uses as much as digits as its factorization.
10212211021601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 10212211021601 its reverse (10612011221201), we get a palindrome (20824222242802).
The spelling of 10212211021601 in words is "ten trillion, two hundred twelve billion, two hundred eleven million, twenty-one thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •