Base | Representation |
---|---|
bin | 10110111101101111101011… |
… | …110011100000000111100101 |
3 | 111020121111221110200211122210 |
4 | 112331233223303200013211 |
5 | 101214241212200041401 |
6 | 554450451100114033 |
7 | 30163005634630566 |
oct | 2675575363400745 |
9 | 436544843624583 |
10 | 101000112112101 |
11 | 2a1aa9a82465a4 |
12 | b3b25b9235919 |
13 | 44483677062b7 |
14 | 1ad26080c016d |
15 | ba23a0cce4d6 |
hex | 5bdbebce01e5 |
101000112112101 has 8 divisors (see below), whose sum is σ = 135858557885760. Its totient is φ = 66737537206592.
The previous prime is 101000112112087. The next prime is 101000112112127. The reversal of 101000112112101 is 101211211000101.
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 101000112112101 - 25 = 101000112112069 is a prime.
It is a super-2 number, since 2×1010001121121012 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101000112112001) 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, 148967716641 + ... + 148967717318.
It is an arithmetic number, because the mean of its divisors is an integer number (16982319735720).
Almost surely, 2101000112112101 is an apocalyptic number.
It is an amenable number.
101000112112101 is a deficient number, since it is larger than the sum of its proper divisors (34858445773659).
101000112112101 is a wasteful number, since it uses less digits than its factorization.
101000112112101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 297935434075.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 101000112112101 its reverse (101211211000101), we get a palindrome (202211323112202).
The spelling of 101000112112101 in words is "one hundred one trillion, one hundred twelve million, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •