Base | Representation |
---|---|
bin | 110011011101… |
… | …111100000001 |
3 | 221101110111120 |
4 | 303131330001 |
5 | 11423220334 |
6 | 1201102453 |
7 | 222452121 |
oct | 63357401 |
9 | 27343446 |
10 | 13491969 |
11 | 7685797 |
12 | 4627a29 |
13 | 2a4511a |
14 | 1b12c81 |
15 | 12b7949 |
hex | cddf01 |
13491969 has 8 divisors (see below), whose sum is σ = 18027072. Its totient is φ = 8975760.
The previous prime is 13491967. The next prime is 13491971. The reversal of 13491969 is 96919431.
It is an interprime number because it is at equal distance from previous prime (13491967) and next prime (13491971).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13491969 - 21 = 13491967 is a prime.
It is a super-2 number, since 2×134919692 = 364066454993922, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13491969.
It is not an unprimeable number, because it can be changed into a prime (13491967) 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 7 ways as a sum of consecutive naturals, for example, 2962 + ... + 5979.
It is an arithmetic number, because the mean of its divisors is an integer number (2253384).
Almost surely, 213491969 is an apocalyptic number.
It is an amenable number.
13491969 is a deficient number, since it is larger than the sum of its proper divisors (4535103).
13491969 is an equidigital number, since it uses as much as digits as its factorization.
13491969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9447.
The product of its digits is 52488, while the sum is 42.
The square root of 13491969 is about 3673.1415709172. The cubic root of 13491969 is about 238.0629320669.
The spelling of 13491969 in words is "thirteen million, four hundred ninety-one thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •