Base | Representation |
---|---|
bin | 1001010010011011011100… |
… | …1101011101000110111101 |
3 | 1100011021111112201000222222 |
4 | 2110212313031131012331 |
5 | 2314304102010121341 |
6 | 33415231443415125 |
7 | 2102544052301330 |
oct | 224466715350675 |
9 | 40137445630888 |
10 | 10212211020221 |
11 | 3287a79986471 |
12 | 118b2409844a5 |
13 | 591013254542 |
14 | 2743b8c7c617 |
15 | 12a99a41c44b |
hex | 949b735d1bd |
10212211020221 has 8 divisors (see below), whose sum is σ = 11701101135360. Its totient is φ = 8730821611728.
The previous prime is 10212211020181. The next prime is 10212211020259. The reversal of 10212211020221 is 12202011221201.
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-10212211020221 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10212211020221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10212211020281) 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, 1875173741 + ... + 1875179186.
It is an arithmetic number, because the mean of its divisors is an integer number (1462637641920).
Almost surely, 210212211020221 is an apocalyptic number.
It is an amenable number.
10212211020221 is a deficient number, since it is larger than the sum of its proper divisors (1488890115139).
10212211020221 is an equidigital number, since it uses as much as digits as its factorization.
10212211020221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3750353323.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 10212211020221 its reverse (12202011221201), we get a palindrome (22414222241422).
The spelling of 10212211020221 in words is "ten trillion, two hundred twelve billion, two hundred eleven million, twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •