Base | Representation |
---|---|
bin | 11010111001111001… |
… | …01011100110110101 |
3 | 1101021122112010110001 |
4 | 31130330223212311 |
5 | 214040221004023 |
6 | 10345143431301 |
7 | 1020641430514 |
oct | 153474534665 |
9 | 41248463401 |
10 | 14444313013 |
11 | 6142490179 |
12 | 2971455531 |
13 | 14926971a0 |
14 | 9b04d467b |
15 | 59814b6ad |
hex | 35cf2b9b5 |
14444313013 has 8 divisors (see below), whose sum is σ = 15596034048. Its totient is φ = 13298394864.
The previous prime is 14444313001. The next prime is 14444313029. The reversal of 14444313013 is 31031344441.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14444313013 is a prime.
It is a super-2 number, since 2×144443130132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14444313083) 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, 1445545 + ... + 1455502.
It is an arithmetic number, because the mean of its divisors is an integer number (1949504256).
Almost surely, 214444313013 is an apocalyptic number.
14444313013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
14444313013 is a deficient number, since it is larger than the sum of its proper divisors (1151721035).
14444313013 is a wasteful number, since it uses less digits than its factorization.
14444313013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2901443.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 14444313013 its reverse (31031344441), we get a palindrome (45475657454).
The spelling of 14444313013 in words is "fourteen billion, four hundred forty-four million, three hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •