Base | Representation |
---|---|
bin | 1001010011000000101010… |
… | …1010001101000001001101 |
3 | 1100012020021202121120222112 |
4 | 2110300022222031001031 |
5 | 2314440031424000023 |
6 | 33424003031353405 |
7 | 2103346445601002 |
oct | 224601252150115 |
9 | 40166252546875 |
10 | 10222201000013 |
11 | 3291235a77112 |
12 | 119116a522865 |
13 | 591c45b43ba2 |
14 | 274a859538a9 |
15 | 12ad8249b478 |
hex | 94c0aa8d04d |
10222201000013 has 2 divisors, whose sum is σ = 10222201000014. Its totient is φ = 10222201000012.
The previous prime is 10222201000001. The next prime is 10222201000021. The reversal of 10222201000013 is 31000010222201.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10213764026404 + 8436973609 = 3195898^2 + 91853^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10222201000013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10222201000313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5111100500006 + 5111100500007.
It is an arithmetic number, because the mean of its divisors is an integer number (5111100500007).
Almost surely, 210222201000013 is an apocalyptic number.
It is an amenable number.
10222201000013 is a deficient number, since it is larger than the sum of its proper divisors (1).
10222201000013 is an equidigital number, since it uses as much as digits as its factorization.
10222201000013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 10222201000013 its reverse (31000010222201), we get a palindrome (41222211222214).
The spelling of 10222201000013 in words is "ten trillion, two hundred twenty-two billion, two hundred one million, thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •