Base | Representation |
---|---|
bin | 11000011001101001… |
… | …00111010101101111 |
3 | 1020210222000000121210 |
4 | 30030310213111233 |
5 | 203312101133403 |
6 | 10003522525503 |
7 | 642426225231 |
oct | 141464472557 |
9 | 36728000553 |
10 | 13100021103 |
11 | 5612690824 |
12 | 2657206893 |
13 | 130a021ca0 |
14 | 8c3b64251 |
15 | 51a10cb03 |
hex | 30cd2756f |
13100021103 has 8 divisors (see below), whose sum is σ = 18810286768. Its totient is φ = 8061551424.
The previous prime is 13100021089. The next prime is 13100021107. The reversal of 13100021103 is 30112000131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-13100021103 is a prime.
It is a super-2 number, since 2×131000211032 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13100021107) 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, 167948950 + ... + 167949027.
It is an arithmetic number, because the mean of its divisors is an integer number (2351285846).
Almost surely, 213100021103 is an apocalyptic number.
13100021103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13100021103 is a deficient number, since it is larger than the sum of its proper divisors (5710265665).
13100021103 is a wasteful number, since it uses less digits than its factorization.
13100021103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335897993.
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 13100021103 its reverse (30112000131), we get a palindrome (43212021234).
The spelling of 13100021103 in words is "thirteen billion, one hundred million, twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •