Base | Representation |
---|---|
bin | 110010001101… |
… | …010011100100 |
3 | 220202200110101 |
4 | 302031103210 |
5 | 11332133300 |
6 | 1150033444 |
7 | 216605206 |
oct | 62152344 |
9 | 26680411 |
10 | 13161700 |
11 | 747a642 |
12 | 44a8884 |
13 | 295a9b6 |
14 | 1a68776 |
15 | 124eb6a |
hex | c8d4e4 |
13161700 has 18 divisors (see below), whose sum is σ = 28561106. Its totient is φ = 5264640.
The previous prime is 13161601. The next prime is 13161703. The reversal of 13161700 is 716131.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 3526884 + 9634816 = 1878^2 + 3104^2 .
It is not an unprimeable number, because it can be changed into a prime (13161703) 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 5 ways as a sum of consecutive naturals, for example, 65709 + ... + 65908.
Almost surely, 213161700 is an apocalyptic number.
13161700 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13161700 is an abundant number, since it is smaller than the sum of its proper divisors (15399406).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13161700 is a wasteful number, since it uses less digits than its factorization.
13161700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131631 (or 131624 counting only the distinct ones).
The product of its (nonzero) digits is 126, while the sum is 19.
The square root of 13161700 is about 3627.9057319616. The cubic root of 13161700 is about 236.1043539268.
Adding to 13161700 its reverse (716131), we get a palindrome (13877831).
It can be divided in two parts, 13161 and 700, that added together give a triangular number (13861 = T166).
The spelling of 13161700 in words is "thirteen million, one hundred sixty-one thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •