Base | Representation |
---|---|
bin | 110100101011… |
… | …000101100001 |
3 | 221222111222021 |
4 | 310223011201 |
5 | 12013323334 |
6 | 1211541441 |
7 | 225236320 |
oct | 64530541 |
9 | 27874867 |
10 | 13807969 |
11 | 788114a |
12 | 475a881 |
13 | 2b25bc6 |
14 | 1b960b7 |
15 | 132b3b4 |
hex | d2b161 |
13807969 has 4 divisors (see below), whose sum is σ = 15780544. Its totient is φ = 11835396.
The previous prime is 13807967. The next prime is 13807991. The reversal of 13807969 is 96970831.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 96970831 = 4513 ⋅21487.
It is a cyclic number.
It is not a de Polignac number, because 13807969 - 21 = 13807967 is a prime.
It is a super-2 number, since 2×138079692 = 381320015809922, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13807967) 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, 986277 + ... + 986290.
It is an arithmetic number, because the mean of its divisors is an integer number (3945136).
Almost surely, 213807969 is an apocalyptic number.
It is an amenable number.
13807969 is a deficient number, since it is larger than the sum of its proper divisors (1972575).
13807969 is an equidigital number, since it uses as much as digits as its factorization.
13807969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1972574.
The product of its (nonzero) digits is 81648, while the sum is 43.
The square root of 13807969 is about 3715.9075607448. The cubic root of 13807969 is about 239.9071921251.
The spelling of 13807969 in words is "thirteen million, eight hundred seven thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •