Base | Representation |
---|---|
bin | 1101000000011100100010… |
… | …0101010011010110000001 |
3 | 1212122012011222101110201112 |
4 | 3100013020211103112001 |
5 | 3333303041201201040 |
6 | 50225533131013105 |
7 | 3004143553515251 |
oct | 320071045232601 |
9 | 55565158343645 |
10 | 14301311350145 |
11 | 4614174471736 |
12 | 172b83429a195 |
13 | 7c97b9662a91 |
14 | 376289807961 |
15 | 19c023790365 |
hex | d01c8953581 |
14301311350145 has 8 divisors (see below), whose sum is σ = 17161611035904. Its totient is φ = 11441024136304.
The previous prime is 14301311350141. The next prime is 14301311350187. The reversal of 14301311350145 is 54105311310341.
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 14301311350145 - 22 = 14301311350141 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14301311350141) 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 7 ways as a sum of consecutive naturals, for example, 376079 + ... + 5361348.
It is an arithmetic number, because the mean of its divisors is an integer number (2145201379488).
Almost surely, 214301311350145 is an apocalyptic number.
It is an amenable number.
14301311350145 is a deficient number, since it is larger than the sum of its proper divisors (2860299685759).
14301311350145 is an equidigital number, since it uses as much as digits as its factorization.
14301311350145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6235959.
The product of its (nonzero) digits is 10800, while the sum is 32.
Adding to 14301311350145 its reverse (54105311310341), we get a palindrome (68406622660486).
The spelling of 14301311350145 in words is "fourteen trillion, three hundred one billion, three hundred eleven million, three hundred fifty thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •