Base | Representation |
---|---|
bin | 10111000000110100000101… |
… | …110101010110011110100101 |
3 | 111021100200021202121102002220 |
4 | 113000310011311112132211 |
5 | 101231220113030431041 |
6 | 555131405330422553 |
7 | 30214152662052105 |
oct | 2700640565263645 |
9 | 437320252542086 |
10 | 101211002202021 |
11 | 2a2813881a5508 |
12 | b427453a31a59 |
13 | 4462205c4965a |
14 | 1adc8d2621205 |
15 | ba7ae5331d66 |
hex | 5c0d05d567a5 |
101211002202021 has 8 divisors (see below), whose sum is σ = 134949187136064. Its totient is φ = 67473409368000.
The previous prime is 101211002202019. The next prime is 101211002202029. The reversal of 101211002202021 is 120202200112101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101211002202021 - 21 = 101211002202019 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101211002202029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 147626001 + ... + 148310006.
It is an arithmetic number, because the mean of its divisors is an integer number (16868648392008).
Almost surely, 2101211002202021 is an apocalyptic number.
It is an amenable number.
101211002202021 is a deficient number, since it is larger than the sum of its proper divisors (33738184934043).
101211002202021 is a wasteful number, since it uses less digits than its factorization.
101211002202021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 296050011.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 101211002202021 its reverse (120202200112101), we get a palindrome (221413202314122).
The spelling of 101211002202021 in words is "one hundred one trillion, two hundred eleven billion, two million, two hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •