Base | Representation |
---|---|
bin | 1100111010101011101111… |
… | …0001001001100111111001 |
3 | 1212021201122112211201021202 |
4 | 3032222323301021213321 |
5 | 3330142313344320231 |
6 | 50112241353343545 |
7 | 2664040351021616 |
oct | 316527361114771 |
9 | 55251575751252 |
10 | 14202312104441 |
11 | 4586191a250aa |
12 | 1714605707bb5 |
13 | 7c0370295956 |
14 | 37157764d50d |
15 | 19967c3355cb |
hex | ceabbc499f9 |
14202312104441 has 8 divisors (see below), whose sum is σ = 14675644017984. Its totient is φ = 13733689961520.
The previous prime is 14202312104401. The next prime is 14202312104527. The reversal of 14202312104441 is 14440121320241.
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 14202312104441 - 222 = 14202307910137 is a prime.
It is a super-2 number, since 2×142023121044412 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14202312104401) 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, 1177436525 + ... + 1177448586.
It is an arithmetic number, because the mean of its divisors is an integer number (1834455502248).
Almost surely, 214202312104441 is an apocalyptic number.
It is an amenable number.
14202312104441 is a deficient number, since it is larger than the sum of its proper divisors (473331913543).
14202312104441 is a wasteful number, since it uses less digits than its factorization.
14202312104441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2354885311.
The product of its (nonzero) digits is 6144, while the sum is 29.
Adding to 14202312104441 its reverse (14440121320241), we get a palindrome (28642433424682).
The spelling of 14202312104441 in words is "fourteen trillion, two hundred two billion, three hundred twelve million, one hundred four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •