Base | Representation |
---|---|
bin | 10110111111001101110000… |
… | …011010010000000011000101 |
3 | 111020222011122221221121002221 |
4 | 112333031300122100003011 |
5 | 101222420044001011323 |
6 | 555005114105332341 |
7 | 30203213013144550 |
oct | 2677156032200305 |
9 | 436864587847087 |
10 | 101101121110213 |
11 | 2a239821190934 |
12 | b40a0a8a970b1 |
13 | 4454a44283733 |
14 | 1ad746b151697 |
15 | ba4d138c655d |
hex | 5bf3706900c5 |
101101121110213 has 8 divisors (see below), whose sum is σ = 122340852436032. Its totient is φ = 81560568290496.
The previous prime is 101101121110193. The next prime is 101101121110261. The reversal of 101101121110213 is 312011121101101.
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 101101121110213 - 25 = 101101121110181 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101101121110273) 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, 424794626395 + ... + 424794626632.
It is an arithmetic number, because the mean of its divisors is an integer number (15292606554504).
Almost surely, 2101101121110213 is an apocalyptic number.
It is an amenable number.
101101121110213 is a deficient number, since it is larger than the sum of its proper divisors (21239731325819).
101101121110213 is an equidigital number, since it uses as much as digits as its factorization.
101101121110213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 849589253051.
The product of its (nonzero) digits is 12, while the sum is 16.
Adding to 101101121110213 its reverse (312011121101101), we get a palindrome (413112242211314).
The spelling of 101101121110213 in words is "one hundred one trillion, one hundred one billion, one hundred twenty-one million, one hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •