Base | Representation |
---|---|
bin | 11010001010001110… |
… | …10010011010000101 |
3 | 1100020210002111001202 |
4 | 31011013102122011 |
5 | 212230334041242 |
6 | 10241341032245 |
7 | 1005014525534 |
oct | 150507223205 |
9 | 40223074052 |
10 | 14044440197 |
11 | 5a577a1877 |
12 | 287b555685 |
13 | 142a89b758 |
14 | 97336431b |
15 | 572eb0932 |
hex | 3451d2685 |
14044440197 has 8 divisors (see below), whose sum is σ = 15653246400. Its totient is φ = 12522596544.
The previous prime is 14044440191. The next prime is 14044440203. The reversal of 14044440197 is 79104444041.
It is an interprime number because it is at equal distance from previous prime (14044440191) and next prime (14044440203).
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 14044440197 - 212 = 14044436101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14044440197.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14044440191) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21740297 + ... + 21740942.
It is an arithmetic number, because the mean of its divisors is an integer number (1956655800).
Almost surely, 214044440197 is an apocalyptic number.
14044440197 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
14044440197 is a deficient number, since it is larger than the sum of its proper divisors (1608806203).
14044440197 is a wasteful number, since it uses less digits than its factorization.
14044440197 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43481275.
The product of its (nonzero) digits is 64512, while the sum is 38.
The spelling of 14044440197 in words is "fourteen billion, forty-four million, four hundred forty thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •