Base | Representation |
---|---|
bin | 101111001101111111… |
… | …1101001001100100101 |
3 | 100200201211121211210011 |
4 | 1132123333221030211 |
5 | 3130132224300401 |
6 | 114325543530221 |
7 | 10216551452041 |
oct | 1363377511445 |
9 | 320654554704 |
10 | 101401400101 |
11 | 3a0054a0801 |
12 | 1779b159971 |
13 | 973cc5b581 |
14 | 4c9d219021 |
15 | 29872a9451 |
hex | 179bfe9325 |
101401400101 has 4 divisors (see below), whose sum is σ = 102072932704. Its totient is φ = 100729867500.
The previous prime is 101401400083. The next prime is 101401400147. The reversal of 101401400101 is 101004104101.
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 101401400101 - 217 = 101401269029 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 (101401403101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 335766075 + ... + 335766376.
It is an arithmetic number, because the mean of its divisors is an integer number (25518233176).
Almost surely, 2101401400101 is an apocalyptic number.
It is an amenable number.
101401400101 is a deficient number, since it is larger than the sum of its proper divisors (671532603).
101401400101 is an equidigital number, since it uses as much as digits as its factorization.
101401400101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 671532602.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101401400101 its reverse (101004104101), we get a palindrome (202405504202).
The spelling of 101401400101 in words is "one hundred one billion, four hundred one million, four hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •