Base | Representation |
---|---|
bin | 110100010000… |
… | …111111101111 |
3 | 221210002101021 |
4 | 310100333233 |
5 | 12001413403 |
6 | 1205355011 |
7 | 224312623 |
oct | 64207757 |
9 | 27702337 |
10 | 13701103 |
11 | 7808929 |
12 | 4708a67 |
13 | 2ab9380 |
14 | 1b69183 |
15 | 13098bd |
hex | d10fef |
13701103 has 8 divisors (see below), whose sum is σ = 14807408. Its totient is φ = 12602304.
The previous prime is 13701097. The next prime is 13701113. The reversal of 13701103 is 30110731.
It is a happy number.
13701103 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13701103 - 29 = 13700591 is a prime.
It is the 3702-nd Hogben number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13701113) by changing a digit.
It is a nontrivial repunit in base 3701.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2275 + ... + 5707.
It is an arithmetic number, because the mean of its divisors is an integer number (1850926).
Almost surely, 213701103 is an apocalyptic number.
13701103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13701103 is a deficient number, since it is larger than the sum of its proper divisors (1106305).
13701103 is a wasteful number, since it uses less digits than its factorization.
13701103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3753.
The product of its (nonzero) digits is 63, while the sum is 16.
The square root of 13701103 is about 3701.5001013103. The cubic root of 13701103 is about 239.2866724590.
Adding to 13701103 its reverse (30110731), we get a palindrome (43811834).
The spelling of 13701103 in words is "thirteen million, seven hundred one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •