Base | Representation |
---|---|
bin | 110100111111… |
… | …111101101001 |
3 | 222010212021101 |
4 | 310333331221 |
5 | 12024042411 |
6 | 1213441401 |
7 | 226043530 |
oct | 64777551 |
9 | 28125241 |
10 | 13893481 |
11 | 792a418 |
12 | 47a0261 |
13 | 2b55ac4 |
14 | 1bb9317 |
15 | 13468c1 |
hex | d3ff69 |
13893481 has 4 divisors (see below), whose sum is σ = 15878272. Its totient is φ = 11908692.
The previous prime is 13893479. The next prime is 13893511. The reversal of 13893481 is 18439831.
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.
It is a cyclic number.
It is not a de Polignac number, because 13893481 - 21 = 13893479 is a prime.
It is a super-2 number, since 2×138934812 = 386057628594722, 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 13893481.
It is not an unprimeable number, because it can be changed into a prime (13893431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 992385 + ... + 992398.
It is an arithmetic number, because the mean of its divisors is an integer number (3969568).
Almost surely, 213893481 is an apocalyptic number.
It is an amenable number.
13893481 is a deficient number, since it is larger than the sum of its proper divisors (1984791).
13893481 is an equidigital number, since it uses as much as digits as its factorization.
13893481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1984790.
The product of its digits is 20736, while the sum is 37.
The square root of 13893481 is about 3727.3960079391. The cubic root of 13893481 is about 240.4014173465.
The spelling of 13893481 in words is "thirteen million, eight hundred ninety-three thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •