Base | Representation |
---|---|
bin | 10110111101110000101101… |
… | …010111101100110010011101 |
3 | 111020121121210010120001010021 |
4 | 112331300231113230302131 |
5 | 101214300440300321341 |
6 | 554451152153112141 |
7 | 30163045122556420 |
oct | 2675605527546235 |
9 | 436547703501107 |
10 | 101001212120221 |
11 | 2a200412166a16 |
12 | b3b28656b8651 |
13 | 44484b158a88a |
14 | 1ad26b02219b7 |
15 | ba24176679d1 |
hex | 5bdc2d5ecc9d |
101001212120221 has 16 divisors (see below), whose sum is σ = 116186695789824. Its totient is φ = 86005684894464.
The previous prime is 101001212120191. The next prime is 101001212120293. The reversal of 101001212120221 is 122021212100101.
It is a cyclic number.
It is not a de Polignac number, because 101001212120221 - 211 = 101001212118173 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101001212120195 and 101001212120204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101001212220221) 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, 30581665 + ... + 33722998.
It is an arithmetic number, because the mean of its divisors is an integer number (7261668486864).
Almost surely, 2101001212120221 is an apocalyptic number.
It is an amenable number.
101001212120221 is a deficient number, since it is larger than the sum of its proper divisors (15185483669603).
101001212120221 is a wasteful number, since it uses less digits than its factorization.
101001212120221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64306140.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 101001212120221 its reverse (122021212100101), we get a palindrome (223022424220322).
The spelling of 101001212120221 in words is "one hundred one trillion, one billion, two hundred twelve million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.222 sec. • engine limits •