Base | Representation |
---|---|
bin | 101111001110000011… |
… | …0001001001110000101 |
3 | 100200201221211102021110 |
4 | 1132130012021032011 |
5 | 3130133143313013 |
6 | 114330044235233 |
7 | 10216602110052 |
oct | 1363406111605 |
9 | 320657742243 |
10 | 101403104133 |
11 | 3a006454aa1 |
12 | 1779b83bb19 |
13 | 9740407086 |
14 | 4c9d540029 |
15 | 29874e42c3 |
hex | 179c189385 |
101403104133 has 4 divisors (see below), whose sum is σ = 135204138848. Its totient is φ = 67602069420.
The previous prime is 101403104119. The next prime is 101403104137. The reversal of 101403104133 is 331401304101.
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 not a de Polignac number, because 101403104133 - 221 = 101401006981 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 (101403104137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16900517353 + ... + 16900517358.
It is an arithmetic number, because the mean of its divisors is an integer number (33801034712).
Almost surely, 2101403104133 is an apocalyptic number.
It is an amenable number.
101403104133 is a deficient number, since it is larger than the sum of its proper divisors (33801034715).
101403104133 is an equidigital number, since it uses as much as digits as its factorization.
101403104133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33801034714.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 101403104133 its reverse (331401304101), we get a palindrome (432804408234).
The spelling of 101403104133 in words is "one hundred one billion, four hundred three million, one hundred four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •