Base | Representation |
---|---|
bin | 110100001100… |
… | …000111001101 |
3 | 221202001221110 |
4 | 310030013031 |
5 | 12000243401 |
6 | 1205122233 |
7 | 224200410 |
oct | 64140715 |
9 | 27661843 |
10 | 13681101 |
11 | 77a48a5 |
12 | 46b9379 |
13 | 2ab0235 |
14 | 1b61b77 |
15 | 13039d6 |
hex | d0c1cd |
13681101 has 8 divisors (see below), whose sum is σ = 20847424. Its totient is φ = 7817760.
The previous prime is 13681099. The next prime is 13681117. The reversal of 13681101 is 10118631.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13681101 - 21 = 13681099 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 651481 = 13681101 / (1 + 3 + 6 + 8 + 1 + 1 + 0 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13682101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 325720 + ... + 325761.
It is an arithmetic number, because the mean of its divisors is an integer number (2605928).
Almost surely, 213681101 is an apocalyptic number.
It is an amenable number.
13681101 is a deficient number, since it is larger than the sum of its proper divisors (7166323).
13681101 is an equidigital number, since it uses as much as digits as its factorization.
13681101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 651491.
The product of its (nonzero) digits is 144, while the sum is 21.
The square root of 13681101 is about 3698.7972369407. The cubic root of 13681101 is about 239.1701722761.
Adding to 13681101 its reverse (10118631), we get a palindrome (23799732).
The spelling of 13681101 in words is "thirteen million, six hundred eighty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •