Base | Representation |
---|---|
bin | 100000110101111… |
… | …0110001101111111 |
3 | 2211210122002001211 |
4 | 1001223312031333 |
5 | 4224103411221 |
6 | 301203545251 |
7 | 36210646540 |
oct | 10153661577 |
9 | 2753562054 |
10 | 1102013311 |
11 | 51606aa03 |
12 | 26908b227 |
13 | 1474071a9 |
14 | a65044c7 |
15 | 66b326e1 |
hex | 41af637f |
1102013311 has 8 divisors (see below), whose sum is σ = 1302873120. Its totient is φ = 912010848.
The previous prime is 1102013309. The next prime is 1102013317. The reversal of 1102013311 is 1133102011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1102013311 - 21 = 1102013309 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1102013291 and 1102013300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102013317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2714116 + ... + 2714521.
It is an arithmetic number, because the mean of its divisors is an integer number (162859140).
Almost surely, 21102013311 is an apocalyptic number.
1102013311 is a deficient number, since it is larger than the sum of its proper divisors (200859809).
1102013311 is an equidigital number, since it uses as much as digits as its factorization.
1102013311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5428673.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 1102013311 is about 33196.5858334859. The cubic root of 1102013311 is about 1032.9095197715.
Adding to 1102013311 its reverse (1133102011), we get a palindrome (2235115322).
The spelling of 1102013311 in words is "one billion, one hundred two million, thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •