Base | Representation |
---|---|
bin | 1101000010001100010101… |
… | …0111101100111011010101 |
3 | 1212202001122111010211200122 |
4 | 3100203011113230323111 |
5 | 3334301021442134331 |
6 | 50251415112121325 |
7 | 3006255344654303 |
oct | 320430527547325 |
9 | 55661574124618 |
10 | 14331322224341 |
11 | 4625974862701 |
12 | 173560a996245 |
13 | 7cc5900645c5 |
14 | 3778d5483273 |
15 | 19cbcd31617b |
hex | d08c55eced5 |
14331322224341 has 32 divisors (see below), whose sum is σ = 15292234653696. Its totient is φ = 13383904608000.
The previous prime is 14331322224337. The next prime is 14331322224343. The reversal of 14331322224341 is 14342222313341.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 14331322224341 - 22 = 14331322224337 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 (14331322224343) 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 31 ways as a sum of consecutive naturals, for example, 3580143446 + ... + 3580147448.
It is an arithmetic number, because the mean of its divisors is an integer number (477882332928).
Almost surely, 214331322224341 is an apocalyptic number.
It is an amenable number.
14331322224341 is a deficient number, since it is larger than the sum of its proper divisors (960912429355).
14331322224341 is a wasteful number, since it uses less digits than its factorization.
14331322224341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6713.
The product of its digits is 82944, while the sum is 35.
Adding to 14331322224341 its reverse (14342222313341), we get a palindrome (28673544537682).
The spelling of 14331322224341 in words is "fourteen trillion, three hundred thirty-one billion, three hundred twenty-two million, two hundred twenty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •