Base | Representation |
---|---|
bin | 100000001001000111001110… |
… | …001101110001110100001001 |
3 | 200112112020110120212121200212 |
4 | 200021013032031301310021 |
5 | 122012100343343103112 |
6 | 1220353332355410505 |
7 | 41530122502612313 |
oct | 4011071615616411 |
9 | 615466416777625 |
10 | 141363718331657 |
11 | 4105201a721068 |
12 | 13a3129b2b3a35 |
13 | 60b5706706863 |
14 | 26ca07d0bc7b3 |
15 | 11522dc2ec522 |
hex | 8091ce371d09 |
141363718331657 has 8 divisors (see below), whose sum is σ = 143701983139200. Its totient is φ = 139026125356560.
The previous prime is 141363718331653. The next prime is 141363718331659. The reversal of 141363718331657 is 756133817363141.
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 141363718331657 - 22 = 141363718331653 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 141363718331596 and 141363718331605.
It is not an unprimeable number, because it can be changed into a prime (141363718331653) 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, 167533793 + ... + 168375470.
It is an arithmetic number, because the mean of its divisors is an integer number (17962747892400).
Almost surely, 2141363718331657 is an apocalyptic number.
It is an amenable number.
141363718331657 is a deficient number, since it is larger than the sum of its proper divisors (2338264807543).
141363718331657 is an equidigital number, since it uses as much as digits as its factorization.
141363718331657 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 335916223.
The product of its digits is 22861440, while the sum is 59.
The spelling of 141363718331657 in words is "one hundred forty-one trillion, three hundred sixty-three billion, seven hundred eighteen million, three hundred thirty-one thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •