Base | Representation |
---|---|
bin | 10110111111011000000101… |
… | …011011101000001011111001 |
3 | 111021000020021211221002101120 |
4 | 112333120011123220023321 |
5 | 101223110302032223001 |
6 | 555014150352535453 |
7 | 30204054565353114 |
oct | 2677300533501371 |
9 | 437006254832346 |
10 | 101112211211001 |
11 | 2a2434a2269791 |
12 | b410282b51589 |
13 | 4455ac0a66b53 |
14 | 1ad7bddd9757b |
15 | ba5262312236 |
hex | 5bf6056e82f9 |
101112211211001 has 4 divisors (see below), whose sum is σ = 134816281614672. Its totient is φ = 67408140807332.
The previous prime is 101112211210999. The next prime is 101112211211041. The reversal of 101112211211001 is 100112112211101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 101112211211001 - 21 = 101112211210999 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101112211211041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16852035201831 + ... + 16852035201836.
It is an arithmetic number, because the mean of its divisors is an integer number (33704070403668).
Almost surely, 2101112211211001 is an apocalyptic number.
It is an amenable number.
101112211211001 is a deficient number, since it is larger than the sum of its proper divisors (33704070403671).
101112211211001 is an equidigital number, since it uses as much as digits as its factorization.
101112211211001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33704070403670.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 101112211211001 its reverse (100112112211101), we get a palindrome (201224323422102).
The spelling of 101112211211001 in words is "one hundred one trillion, one hundred twelve billion, two hundred eleven million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •