Base | Representation |
---|---|
bin | 110010011001… |
… | …100011011101 |
3 | 220212020021111 |
4 | 302121203131 |
5 | 11340234434 |
6 | 1151102021 |
7 | 220204366 |
oct | 62314335 |
9 | 26766244 |
10 | 13211869 |
11 | 7504300 |
12 | 4511911 |
13 | 2977798 |
14 | 1a7cb6d |
15 | 125e964 |
hex | c998dd |
13211869 has 12 divisors (see below), whose sum is σ = 14646492. Its totient is φ = 11908160.
The previous prime is 13211843. The next prime is 13211899. The reversal of 13211869 is 96811231.
It can be written as a sum of positive squares in 2 ways, for example, as 7086244 + 6125625 = 2662^2 + 2475^2 .
It is not a de Polignac number, because 13211869 - 27 = 13211741 is a prime.
It is a super-2 number, since 2×132118692 = 349106964946322, which contains 22 as substring.
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 13211869.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13211819) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 16179 + ... + 16975.
It is an arithmetic number, because the mean of its divisors is an integer number (1220541).
Almost surely, 213211869 is an apocalyptic number.
It is an amenable number.
13211869 is a deficient number, since it is larger than the sum of its proper divisors (1434623).
13211869 is a wasteful number, since it uses less digits than its factorization.
13211869 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 956 (or 945 counting only the distinct ones).
The product of its digits is 2592, while the sum is 31.
The square root of 13211869 is about 3634.8134752694. The cubic root of 13211869 is about 236.4039631704.
The spelling of 13211869 in words is "thirteen million, two hundred eleven thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •