Base | Representation |
---|---|
bin | 1001010001110001110000… |
… | …1111101011011101011101 |
3 | 1100010012121201002021200012 |
4 | 2110130130033223131131 |
5 | 2314113142411401341 |
6 | 33410141235013005 |
7 | 2101666546350365 |
oct | 224343417533535 |
9 | 40105551067605 |
10 | 10201021200221 |
11 | 3283257589045 |
12 | 118903943a165 |
13 | 58cc4bbc8387 |
14 | 273a36ab99a5 |
15 | 12a542d850eb |
hex | 9471c3eb75d |
10201021200221 has 8 divisors (see below), whose sum is σ = 10202684104704. Its totient is φ = 10199358449280.
The previous prime is 10201021200143. The next prime is 10201021200281. The reversal of 10201021200221 is 12200212010201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10201021200221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10201021200196 and 10201021200205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201021200281) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 228490061 + ... + 228534701.
It is an arithmetic number, because the mean of its divisors is an integer number (1275335513088).
Almost surely, 210201021200221 is an apocalyptic number.
It is an amenable number.
10201021200221 is a deficient number, since it is larger than the sum of its proper divisors (1662904483).
10201021200221 is a wasteful number, since it uses less digits than its factorization.
10201021200221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76771.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10201021200221 its reverse (12200212010201), we get a palindrome (22401233210422).
The spelling of 10201021200221 in words is "ten trillion, two hundred one billion, twenty-one million, two hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •