Base | Representation |
---|---|
bin | 10111000000110100001100… |
… | …010000101001100000000001 |
3 | 111021100200120021111012002220 |
4 | 113000310030100221200001 |
5 | 101231220323131133441 |
6 | 555131424141401253 |
7 | 30214155441361362 |
oct | 2700641420514001 |
9 | 437320507435086 |
10 | 101211110021121 |
11 | 2a281433047601 |
12 | b427483b69229 |
13 | 446222239a139 |
14 | 1adc902a89b69 |
15 | ba7aeea2d466 |
hex | 5c0d0c429801 |
101211110021121 has 8 divisors (see below), whose sum is σ = 135978285219744. Its totient is φ = 66959004084960.
The previous prime is 101211110021089. The next prime is 101211110021123. The reversal of 101211110021121 is 121120011112101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101211110021121 - 25 = 101211110021089 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101211110021121.
It is not an unprimeable number, because it can be changed into a prime (101211110021123) 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, 128767315156 + ... + 128767315941.
It is an arithmetic number, because the mean of its divisors is an integer number (16997285652468).
Almost surely, 2101211110021121 is an apocalyptic number.
It is an amenable number.
101211110021121 is a deficient number, since it is larger than the sum of its proper divisors (34767175198623).
101211110021121 is a wasteful number, since it uses less digits than its factorization.
101211110021121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257534631231.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 101211110021121 its reverse (121120011112101), we get a palindrome (222331121133222).
The spelling of 101211110021121 in words is "one hundred one trillion, two hundred eleven billion, one hundred ten million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •