Base | Representation |
---|---|
bin | 10110111111011001000001… |
… | …101000110111000111111101 |
3 | 111021000022220020121120212111 |
4 | 112333121001220313013331 |
5 | 101223114334124004041 |
6 | 555014434514534021 |
7 | 30204121612160011 |
oct | 2677310150670775 |
9 | 437008806546774 |
10 | 101113221313021 |
11 | 2a243970462345 |
12 | b410505297311 |
13 | 4455c22100158 |
14 | 1ad7c981b4541 |
15 | ba52c0d3b981 |
hex | 5bf641a371fd |
101113221313021 has 16 divisors (see below), whose sum is σ = 106565885236800. Its totient is φ = 95673668548608.
The previous prime is 101113221313003. The next prime is 101113221313061. The reversal of 101113221313021 is 120313122311101.
It is a cyclic number.
It is not a de Polignac number, because 101113221313021 - 27 = 101113221312893 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101113221312983 and 101113221313001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101113221313061) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 189575250 + ... + 190107868.
It is an arithmetic number, because the mean of its divisors is an integer number (6660367827300).
Almost surely, 2101113221313021 is an apocalyptic number.
It is an amenable number.
101113221313021 is a deficient number, since it is larger than the sum of its proper divisors (5452663923779).
101113221313021 is a wasteful number, since it uses less digits than its factorization.
101113221313021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 544908.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 101113221313021 its reverse (120313122311101), we get a palindrome (221426343624122).
The spelling of 101113221313021 in words is "one hundred one trillion, one hundred thirteen billion, two hundred twenty-one million, three hundred thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •