Base | Representation |
---|---|
bin | 10110111111100011100011… |
… | …001001110111111000000101 |
3 | 111021001102001202000211221001 |
4 | 112333203203021313320011 |
5 | 101223311004341030341 |
6 | 555023544051053301 |
7 | 30205001621205460 |
oct | 2677434311677005 |
9 | 437042052024831 |
10 | 101124521033221 |
11 | 2a2487398a3384 |
12 | b4127395a1231 |
13 | 445700315811a |
14 | 1ad864abc42d7 |
15 | ba5732d81d31 |
hex | 5bf8e3277e05 |
101124521033221 has 16 divisors (see below), whose sum is σ = 116400036234240. Its totient is φ = 86058131725440.
The previous prime is 101124521033203. The next prime is 101124521033299. The reversal of 101124521033221 is 122330125421101.
It is not a de Polignac number, because 101124521033221 - 25 = 101124521033189 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101124521033221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101124521033821) 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, 75886200 + ... + 77207281.
It is an arithmetic number, because the mean of its divisors is an integer number (7275002264640).
Almost surely, 2101124521033221 is an apocalyptic number.
It is an amenable number.
101124521033221 is a deficient number, since it is larger than the sum of its proper divisors (15275515201019).
101124521033221 is a wasteful number, since it uses less digits than its factorization.
101124521033221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153094164.
The product of its (nonzero) digits is 2880, while the sum is 28.
Adding to 101124521033221 its reverse (122330125421101), we get a palindrome (223454646454322).
The spelling of 101124521033221 in words is "one hundred one trillion, one hundred twenty-four billion, five hundred twenty-one million, thirty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •