Base | Representation |
---|---|
bin | 1100110001111001001011… |
… | …1011101010111101111001 |
3 | 1211202021212110211120002210 |
4 | 3030132102323222331321 |
5 | 3320204032101004431 |
6 | 45515025103245333 |
7 | 2650113251015652 |
oct | 314362273527571 |
9 | 54667773746083 |
10 | 14051303141241 |
11 | 4528140340a73 |
12 | 16ab2a0ba9849 |
13 | 7ac05598b662 |
14 | 36812dc9a529 |
15 | 19578eda3d46 |
hex | cc792eeaf79 |
14051303141241 has 8 divisors (see below), whose sum is σ = 18916964747200. Its totient is φ = 9276588481392.
The previous prime is 14051303141219. The next prime is 14051303141303. The reversal of 14051303141241 is 14214130315041.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14051303141241 - 221 = 14051301044089 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14051303141199 and 14051303141208.
It is not an unprimeable number, because it can be changed into a prime (14051303141041) 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, 22736736166 + ... + 22736736783.
It is an arithmetic number, because the mean of its divisors is an integer number (2364620593400).
Almost surely, 214051303141241 is an apocalyptic number.
It is an amenable number.
14051303141241 is a deficient number, since it is larger than the sum of its proper divisors (4865661605959).
14051303141241 is a wasteful number, since it uses less digits than its factorization.
14051303141241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45473473055.
The product of its (nonzero) digits is 5760, while the sum is 30.
Adding to 14051303141241 its reverse (14214130315041), we get a palindrome (28265433456282).
The spelling of 14051303141241 in words is "fourteen trillion, fifty-one billion, three hundred three million, one hundred forty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •