Base | Representation |
---|---|
bin | 10110111111001101101001… |
… | …110110001101111101111011 |
3 | 111020222011101021202110221202 |
4 | 112333031221312031331323 |
5 | 101222414332304014321 |
6 | 555005055133324415 |
7 | 30203210205220214 |
oct | 2677155166157573 |
9 | 436864337673852 |
10 | 101101011001211 |
11 | 2a239775015361 |
12 | b40a07803670b |
13 | 4454a27510890 |
14 | 1ad745a68c40b |
15 | ba4d08dc670b |
hex | 5bf369d8df7b |
101101011001211 has 8 divisors (see below), whose sum is σ = 114608433523920. Its totient is φ = 88412220146592.
The previous prime is 101101011001171. The next prime is 101101011001241. The reversal of 101101011001211 is 112100110101101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101101011001211 - 26 = 101101011001147 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101101011001192 and 101101011001201.
It is not an unprimeable number, because it can be changed into a prime (101101011001241) 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, 204657916760 + ... + 204657917253.
It is an arithmetic number, because the mean of its divisors is an integer number (14326054190490).
Almost surely, 2101101011001211 is an apocalyptic number.
101101011001211 is a deficient number, since it is larger than the sum of its proper divisors (13507422522709).
101101011001211 is a wasteful number, since it uses less digits than its factorization.
101101011001211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 409315834045.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 101101011001211 its reverse (112100110101101), we get a palindrome (213201121102312).
The spelling of 101101011001211 in words is "one hundred one trillion, one hundred one billion, eleven million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •