Base | Representation |
---|---|
bin | 1001010010111101101011… |
… | …1110011100100010100101 |
3 | 1100012011020000021101102011 |
4 | 2110233122332130202211 |
5 | 2314431412124000401 |
6 | 33423351412514221 |
7 | 2103320562654514 |
oct | 224573276344245 |
9 | 40164200241364 |
10 | 10221401000101 |
11 | 3290965436365 |
12 | 1190b8661b971 |
13 | 591b49191065 |
14 | 274a0b5c867b |
15 | 12ad37124451 |
hex | 94bdaf9c8a5 |
10221401000101 has 2 divisors, whose sum is σ = 10221401000102. Its totient is φ = 10221401000100.
The previous prime is 10221401000089. The next prime is 10221401000113. The reversal of 10221401000101 is 10100010412201.
It is a balanced prime because it is at equal distance from previous prime (10221401000089) and next prime (10221401000113).
It can be written as a sum of positive squares in only one way, i.e., 6265379449476 + 3956021550625 = 2503074^2 + 1988975^2 .
It is a cyclic number.
It is not a de Polignac number, because 10221401000101 - 219 = 10221400475813 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10221401000131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5110700500050 + 5110700500051.
It is an arithmetic number, because the mean of its divisors is an integer number (5110700500051).
Almost surely, 210221401000101 is an apocalyptic number.
It is an amenable number.
10221401000101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10221401000101 is an equidigital number, since it uses as much as digits as its factorization.
10221401000101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10221401000101 its reverse (10100010412201), we get a palindrome (20321411412302).
The spelling of 10221401000101 in words is "ten trillion, two hundred twenty-one billion, four hundred one million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.279 sec. • engine limits •