Base | Representation |
---|---|
bin | 110011000100… |
… | …000011110011 |
3 | 221012002002201 |
4 | 303010003303 |
5 | 11411322341 |
6 | 1154524031 |
7 | 221531104 |
oct | 63040363 |
9 | 27162081 |
10 | 13385971 |
11 | 7613095 |
12 | 4596617 |
13 | 2a08ac1 |
14 | 1ac63ab |
15 | 1296331 |
hex | cc40f3 |
13385971 has 8 divisors (see below), whose sum is σ = 13801904. Its totient is φ = 12972960.
The previous prime is 13385951. The next prime is 13386001. The reversal of 13385971 is 17958331.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13385971 - 221 = 11288819 is a prime.
It is a super-2 number, since 2×133859712 = 358368439225682, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13385971.
It is not an unprimeable number, because it can be changed into a prime (13385921) 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, 11701 + ... + 12793.
It is an arithmetic number, because the mean of its divisors is an integer number (1725238).
Almost surely, 213385971 is an apocalyptic number.
13385971 is a deficient number, since it is larger than the sum of its proper divisors (415933).
13385971 is a wasteful number, since it uses less digits than its factorization.
13385971 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1461.
The product of its digits is 22680, while the sum is 37.
The square root of 13385971 is about 3658.6843263665. The cubic root of 13385971 is about 237.4378548391.
The spelling of 13385971 in words is "thirteen million, three hundred eighty-five thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •