Base | Representation |
---|---|
bin | 1001010010011011000010… |
… | …1010001011100111001101 |
3 | 1100011021012212220000211020 |
4 | 2110212300222023213031 |
5 | 2314303340341011341 |
6 | 33415212515544353 |
7 | 2102541246133113 |
oct | 224466052134715 |
9 | 40137185800736 |
10 | 10212101110221 |
11 | 3287a2293645a |
12 | 118b20bbbb0b9 |
13 | 590cc655113a |
14 | 2743a842bab3 |
15 | 12a99095b566 |
hex | 949b0a8b9cd |
10212101110221 has 8 divisors (see below), whose sum is σ = 14417083920384. Its totient is φ = 6407592853440.
The previous prime is 10212101110207. The next prime is 10212101110241. The reversal of 10212101110221 is 12201110121201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10212101110221 - 211 = 10212101108173 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10212101110221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10212101110201) 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, 100118638285 + ... + 100118638386.
It is an arithmetic number, because the mean of its divisors is an integer number (1802135490048).
Almost surely, 210212101110221 is an apocalyptic number.
It is an amenable number.
10212101110221 is a deficient number, since it is larger than the sum of its proper divisors (4204982810163).
10212101110221 is a wasteful number, since it uses less digits than its factorization.
10212101110221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200237276691.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10212101110221 its reverse (12201110121201), we get a palindrome (22413211231422).
The spelling of 10212101110221 in words is "ten trillion, two hundred twelve billion, one hundred one million, one hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •