Base | Representation |
---|---|
bin | 10100101011011101… |
… | …10100011001010101 |
3 | 1001122201101200210011 |
4 | 22111232310121111 |
5 | 140214103404023 |
6 | 5033350400221 |
7 | 542055360610 |
oct | 122556643125 |
9 | 31581350704 |
10 | 11102013013 |
11 | 4787884773 |
12 | 219a060071 |
13 | 107c0c4490 |
14 | 774667177 |
15 | 44e9e050d |
hex | 295bb4655 |
11102013013 has 16 divisors (see below), whose sum is σ = 14467783680. Its totient is φ = 8267302656.
The previous prime is 11102013011. The next prime is 11102013023. The reversal of 11102013013 is 31031020111.
It is a cyclic number.
It is not a de Polignac number, because 11102013013 - 21 = 11102013011 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
11102013013 is a modest number, since divided by 13013 gives 11102 as remainder.
It is a junction number, because it is equal to n+sod(n) for n = 11102012984 and 11102013002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11102013011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3586693 + ... + 3589786.
It is an arithmetic number, because the mean of its divisors is an integer number (904236480).
Almost surely, 211102013013 is an apocalyptic number.
11102013013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11102013013 is a deficient number, since it is larger than the sum of its proper divisors (3365770667).
11102013013 is a wasteful number, since it uses less digits than its factorization.
11102013013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7176516.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 11102013013 its reverse (31031020111), we get a palindrome (42133033124).
The spelling of 11102013013 in words is "eleven billion, one hundred two million, thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •