Base | Representation |
---|---|
bin | 1001010011000000101010… |
… | …1010100101011101000101 |
3 | 1100012020021202210200021111 |
4 | 2110300022222211131011 |
5 | 2314440031440200401 |
6 | 33424003033445021 |
7 | 2103346446465544 |
oct | 224601252453505 |
9 | 40166252720244 |
10 | 10222201100101 |
11 | 3291236035331 |
12 | 119116a570771 |
13 | 591c45b7a603 |
14 | 274a8597c15b |
15 | 12ad824bae51 |
hex | 94c0aaa5745 |
10222201100101 has 8 divisors (see below), whose sum is σ = 10238021977824. Its totient is φ = 10206380733360.
The previous prime is 10222201100081. The next prime is 10222201100119. The reversal of 10222201100101 is 10100110222201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10222201100101 - 219 = 10222200575813 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10222201100131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 67383706 + ... + 67535236.
It is an arithmetic number, because the mean of its divisors is an integer number (1279752747228).
Almost surely, 210222201100101 is an apocalyptic number.
It is an amenable number.
10222201100101 is a deficient number, since it is larger than the sum of its proper divisors (15820877723).
10222201100101 is a wasteful number, since it uses less digits than its factorization.
10222201100101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255491.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10222201100101 its reverse (10100110222201), we get a palindrome (20322311322302).
The spelling of 10222201100101 in words is "ten trillion, two hundred twenty-two billion, two hundred one million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.159 sec. • engine limits •