Base | Representation |
---|---|
bin | 10111000000101001110110… |
… | …000111001000111000010101 |
3 | 111021022121220001221000101210 |
4 | 113000221312013020320111 |
5 | 101231030100224324341 |
6 | 555122345541012033 |
7 | 30213313236346410 |
oct | 2700516607107025 |
9 | 437277801830353 |
10 | 101200001011221 |
11 | 2a277752323a92 |
12 | b4252a36b4019 |
13 | 44611719c5cb8 |
14 | 1adc16b520b77 |
15 | ba769e609c16 |
hex | 5c0a761c8e15 |
101200001011221 has 32 divisors (see below), whose sum is σ = 154405759887360. Its totient is φ = 57755027064384.
The previous prime is 101200001011163. The next prime is 101200001011253. The reversal of 101200001011221 is 122110100002101.
It is not a de Polignac number, because 101200001011221 - 210 = 101200001010197 is a prime.
It is a super-2 number, since 2×1012000010112212 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101200001011197 and 101200001011206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101200001011321) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 55685335 + ... + 57473963.
It is an arithmetic number, because the mean of its divisors is an integer number (4825179996480).
Almost surely, 2101200001011221 is an apocalyptic number.
It is an amenable number.
101200001011221 is a deficient number, since it is larger than the sum of its proper divisors (53205758876139).
101200001011221 is a wasteful number, since it uses less digits than its factorization.
101200001011221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1792065.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101200001011221 its reverse (122110100002101), we get a palindrome (223310101013322).
The spelling of 101200001011221 in words is "one hundred one trillion, two hundred billion, one million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •