Base | Representation |
---|---|
bin | 1100110001111100010001… |
… | …0011110010000101100001 |
3 | 1211202101000012121212000211 |
4 | 3030133010103302011201 |
5 | 3320212231133423231 |
6 | 45515243215014121 |
7 | 2650142630233363 |
oct | 314370423620541 |
9 | 54671005555024 |
10 | 14052131545441 |
11 | 4528525a12340 |
12 | 16ab49250a341 |
13 | 7ac1584a8062 |
14 | 3681abcdad33 |
15 | 1957dc98beb1 |
hex | cc7c44f2161 |
14052131545441 has 8 divisors (see below), whose sum is σ = 15406631208000. Its totient is φ = 12710470742640.
The previous prime is 14052131545391. The next prime is 14052131545457. The reversal of 14052131545441 is 14454513125041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14052131545441 - 29 = 14052131544929 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14052131545394 and 14052131545403.
It is not an unprimeable number, because it can be changed into a prime (14052131543441) 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, 3209712646 + ... + 3209717023.
It is an arithmetic number, because the mean of its divisors is an integer number (1925828901000).
Almost surely, 214052131545441 is an apocalyptic number.
14052131545441 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
14052131545441 is a deficient number, since it is larger than the sum of its proper divisors (1354499662559).
14052131545441 is a wasteful number, since it uses less digits than its factorization.
14052131545441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6419429879.
The product of its (nonzero) digits is 192000, while the sum is 40.
The spelling of 14052131545441 in words is "fourteen trillion, fifty-two billion, one hundred thirty-one million, five hundred forty-five thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •