Base | Representation |
---|---|
bin | 110100011011… |
… | …110000001001 |
3 | 221212022211001 |
4 | 310123300021 |
5 | 12004321121 |
6 | 1210335001 |
7 | 224555233 |
oct | 64336011 |
9 | 27768731 |
10 | 13745161 |
11 | 7838a41 |
12 | 472a461 |
13 | 2b03441 |
14 | 1b7b253 |
15 | 1317991 |
hex | d1bc09 |
13745161 has 4 divisors (see below), whose sum is σ = 13755924. Its totient is φ = 13734400.
The previous prime is 13745153. The next prime is 13745177. The reversal of 13745161 is 16154731.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 9418761 + 4326400 = 3069^2 + 2080^2 .
It is a cyclic number.
It is not a de Polignac number, because 13745161 - 23 = 13745153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13745141) 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 3 ways as a sum of consecutive naturals, for example, 3160 + ... + 6121.
It is an arithmetic number, because the mean of its divisors is an integer number (3438981).
Almost surely, 213745161 is an apocalyptic number.
It is an amenable number.
13745161 is a deficient number, since it is larger than the sum of its proper divisors (10763).
13745161 is an equidigital number, since it uses as much as digits as its factorization.
13745161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10762.
The product of its digits is 2520, while the sum is 28.
The square root of 13745161 is about 3707.4466955035. The cubic root of 13745161 is about 239.5428857003.
Adding to 13745161 its reverse (16154731), we get a palindrome (29899892).
The spelling of 13745161 in words is "thirteen million, seven hundred forty-five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •