Base | Representation |
---|---|
bin | 101111001011111101… |
… | …1100110011000100101 |
3 | 100200120002100111112212 |
4 | 1132113323212120211 |
5 | 3130012301344031 |
6 | 114315110453205 |
7 | 10215063152522 |
oct | 1362773463045 |
9 | 320502314485 |
10 | 101333231141 |
11 | 39a7aa7041a |
12 | 17780364205 |
13 | 972bab12cc |
14 | 4c94152149 |
15 | 29812e112b |
hex | 1797ee6625 |
101333231141 has 4 divisors (see below), whose sum is σ = 101597809152. Its totient is φ = 101068653132.
The previous prime is 101333231123. The next prime is 101333231189. The reversal of 101333231141 is 141132333101.
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, and also an emirpimes, since its reverse is a distinct semiprime: 141132333101 = 331 ⋅426381671.
It is a cyclic number.
It is not a de Polignac number, because 101333231141 - 226 = 101266122277 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 (101333231641) 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, 132288431 + ... + 132289196.
It is an arithmetic number, because the mean of its divisors is an integer number (25399452288).
Almost surely, 2101333231141 is an apocalyptic number.
It is an amenable number.
101333231141 is a deficient number, since it is larger than the sum of its proper divisors (264578011).
101333231141 is an equidigital number, since it uses as much as digits as its factorization.
101333231141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 264578010.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 101333231141 its reverse (141132333101), we get a palindrome (242465564242).
The spelling of 101333231141 in words is "one hundred one billion, three hundred thirty-three million, two hundred thirty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •