Base | Representation |
---|---|
bin | 1101001000110000111010… |
… | …1010010110111001010111 |
3 | 1220010212001121002221111102 |
4 | 3102030032222112321113 |
5 | 3343123231034020203 |
6 | 50415330012500315 |
7 | 3020363155512452 |
oct | 322141652267127 |
9 | 56125047087442 |
10 | 14444221001303 |
11 | 466983a216855 |
12 | 175347847a69b |
13 | 80a112c94642 |
14 | 37d165640499 |
15 | 1a0ad9b5a888 |
hex | d230ea96e57 |
14444221001303 has 4 divisors (see below), whose sum is σ = 14460076349088. Its totient is φ = 14428365653520.
The previous prime is 14444221001257. The next prime is 14444221001341. The reversal of 14444221001303 is 30310012244441.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 14444221001303 - 26 = 14444221001239 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14444221001383) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7927672526 + ... + 7927674347.
It is an arithmetic number, because the mean of its divisors is an integer number (3615019087272).
Almost surely, 214444221001303 is an apocalyptic number.
14444221001303 is a deficient number, since it is larger than the sum of its proper divisors (15855347785).
14444221001303 is an equidigital number, since it uses as much as digits as its factorization.
14444221001303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15855347784.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 14444221001303 its reverse (30310012244441), we get a palindrome (44754233245744).
The spelling of 14444221001303 in words is "fourteen trillion, four hundred forty-four billion, two hundred twenty-one million, one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •