Base | Representation |
---|---|
bin | 100000110100110… |
… | …0000110011011111 |
3 | 2211202110222120011 |
4 | 1001221200303133 |
5 | 4223424320221 |
6 | 301142504051 |
7 | 36202520353 |
oct | 10151406337 |
9 | 2752428504 |
10 | 1101401311 |
11 | 51579211a |
12 | 268a35027 |
13 | 14725176a |
14 | a63c5463 |
15 | 66a611e1 |
hex | 41a60cdf |
1101401311 has 4 divisors (see below), whose sum is σ = 1131168952. Its totient is φ = 1071633672.
The previous prime is 1101401293. The next prime is 1101401317. The reversal of 1101401311 is 1131041011.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1131041011 = 31147 ⋅36313.
It is a cyclic number.
It is not a de Polignac number, because 1101401311 - 211 = 1101399263 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1101401291 and 1101401300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101401317) 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, 14883765 + ... + 14883838.
It is an arithmetic number, because the mean of its divisors is an integer number (282792238).
Almost surely, 21101401311 is an apocalyptic number.
1101401311 is a deficient number, since it is larger than the sum of its proper divisors (29767641).
1101401311 is an equidigital number, since it uses as much as digits as its factorization.
1101401311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29767640.
The product of its (nonzero) digits is 12, while the sum is 13.
The square root of 1101401311 is about 33187.3667379622. The cubic root of 1101401311 is about 1032.7182765638.
Adding to 1101401311 its reverse (1131041011), we get a palindrome (2232442322).
The spelling of 1101401311 in words is "one billion, one hundred one million, four hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •