Base | Representation |
---|---|
bin | 101111000101101001… |
… | …0000101010011001011 |
3 | 100200000022001010010212 |
4 | 1132023102011103023 |
5 | 3124043440134011 |
6 | 114242050231335 |
7 | 10206605332454 |
oct | 1361322052313 |
9 | 320008033125 |
10 | 101121021131 |
11 | 399811a8949 |
12 | 1772128554b |
13 | 96c6b40560 |
14 | 4c73cb212b |
15 | 296c87408b |
hex | 178b4854cb |
101121021131 has 4 divisors (see below), whose sum is σ = 108899561232. Its totient is φ = 93342481032.
The previous prime is 101121021119. The next prime is 101121021143. The reversal of 101121021131 is 131120121101.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (101121021119) and next prime (101121021143).
It is a cyclic number.
It is not a de Polignac number, because 101121021131 - 218 = 101120758987 is a prime.
It is a super-2 number, since 2×1011210211312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101121021101) 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, 3889270031 + ... + 3889270056.
It is an arithmetic number, because the mean of its divisors is an integer number (27224890308).
Almost surely, 2101121021131 is an apocalyptic number.
101121021131 is a deficient number, since it is larger than the sum of its proper divisors (7778540101).
101121021131 is an equidigital number, since it uses as much as digits as its factorization.
101121021131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7778540100.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 101121021131 its reverse (131120121101), we get a palindrome (232241142232).
The spelling of 101121021131 in words is "one hundred one billion, one hundred twenty-one million, twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •