Base | Representation |
---|---|
bin | 101011111001110111… |
… | …101111010110111001 |
3 | 11111200101122011021202 |
4 | 223321313233112321 |
5 | 1233021300433031 |
6 | 33353500343545 |
7 | 3256134534041 |
oct | 537167572671 |
9 | 144611564252 |
10 | 47141811641 |
11 | 18aa1361911 |
12 | 9177844bb5 |
13 | 45a387b302 |
14 | 23d2cc0721 |
15 | 135d9b42cb |
hex | af9def5b9 |
47141811641 has 4 divisors (see below), whose sum is σ = 47162230500. Its totient is φ = 47121392784.
The previous prime is 47141811617. The next prime is 47141811667. The reversal of 47141811641 is 14611814174.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 44815196416 + 2326615225 = 211696^2 + 48235^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-47141811641 is a prime.
It is a super-2 number, since 2×471418116412 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 47141811595 and 47141811604.
It is not an unprimeable number, because it can be changed into a prime (47141811341) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10205966 + ... + 10210583.
It is an arithmetic number, because the mean of its divisors is an integer number (11790557625).
Almost surely, 247141811641 is an apocalyptic number.
It is an amenable number.
47141811641 is a deficient number, since it is larger than the sum of its proper divisors (20418859).
47141811641 is a wasteful number, since it uses less digits than its factorization.
47141811641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20418858.
The product of its digits is 21504, while the sum is 38.
The spelling of 47141811641 in words is "forty-seven billion, one hundred forty-one million, eight hundred eleven thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •