Base | Representation |
---|---|
bin | 1001010010010111010100… |
… | …0000000101101011000101 |
3 | 1100011011122010112112200210 |
4 | 2110211311000011223011 |
5 | 2314244313124020401 |
6 | 33414525323230033 |
7 | 2102504403534114 |
oct | 224456500055305 |
9 | 40134563475623 |
10 | 10211100220101 |
11 | 3287559964940 |
12 | 118ab90978319 |
13 | 590b97091a71 |
14 | 27431152bc7b |
15 | 12a932b514d6 |
hex | 94975005ac5 |
10211100220101 has 8 divisors (see below), whose sum is σ = 14852509411104. Its totient is φ = 6188545587920.
The previous prime is 10211100220043. The next prime is 10211100220141. The reversal of 10211100220101 is 10102200111201.
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 10211100220101 - 210 = 10211100219077 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10211100220141) 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, 154713639666 + ... + 154713639731.
It is an arithmetic number, because the mean of its divisors is an integer number (1856563676388).
Almost surely, 210211100220101 is an apocalyptic number.
10211100220101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10211100220101 is a deficient number, since it is larger than the sum of its proper divisors (4641409191003).
10211100220101 is a wasteful number, since it uses less digits than its factorization.
10211100220101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 309427279411.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10211100220101 its reverse (10102200111201), we get a palindrome (20313300331302).
The spelling of 10211100220101 in words is "ten trillion, two hundred eleven billion, one hundred million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •