Base | Representation |
---|---|
bin | 110101010011… |
… | …101000100001 |
3 | 222021221210101 |
4 | 311103220201 |
5 | 12034132144 |
6 | 1215302401 |
7 | 226530445 |
oct | 65235041 |
9 | 28257711 |
10 | 13974049 |
11 | 7984a01 |
12 | 481aa01 |
13 | 2b8368b |
14 | 1bda825 |
15 | 13606d4 |
hex | d53a21 |
13974049 has 8 divisors (see below), whose sum is σ = 14411880. Its totient is φ = 13539456.
The previous prime is 13974043. The next prime is 13974053. The reversal of 13974049 is 94047931.
It can be written as a sum of positive squares in 4 ways, for example, as 10679824 + 3294225 = 3268^2 + 1815^2 .
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 13974049 - 29 = 13973537 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13973999 and 13974017.
It is not an unprimeable number, because it can be changed into a prime (13974043) 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, 10197 + ... + 11485.
It is an arithmetic number, because the mean of its divisors is an integer number (1801485).
Almost surely, 213974049 is an apocalyptic number.
It is an amenable number.
13974049 is a deficient number, since it is larger than the sum of its proper divisors (437831).
13974049 is a wasteful number, since it uses less digits than its factorization.
13974049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1619.
The product of its (nonzero) digits is 27216, while the sum is 37.
The square root of 13974049 is about 3738.1879300003. The cubic root of 13974049 is about 240.8652162092.
The spelling of 13974049 in words is "thirteen million, nine hundred seventy-four thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •