Base | Representation |
---|---|
bin | 100001100000011100110000… |
… | …111010011110110100111001 |
3 | 201022202222222010200022212112 |
4 | 201200130300322132310321 |
5 | 123303413412020430131 |
6 | 1241230430011422105 |
7 | 43016542032225422 |
oct | 4140346072366471 |
9 | 638688863608775 |
10 | 147365443530041 |
11 | 42a56374077600 |
12 | 146404b0a54935 |
13 | 642c66a2c64a9 |
14 | 2856750072649 |
15 | 12084a796502b |
hex | 860730e9ed39 |
147365443530041 has 12 divisors (see below), whose sum is σ = 162091831946352. Its totient is φ = 133876256415000.
The previous prime is 147365443530037. The next prime is 147365443530077. The reversal of 147365443530041 is 140035344563741.
It is not a de Polignac number, because 147365443530041 - 22 = 147365443530037 is a prime.
It is not an unprimeable number, because it can be changed into a prime (147365443536041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 419499215 + ... + 419850356.
It is an arithmetic number, because the mean of its divisors is an integer number (13507652662196).
Almost surely, 2147365443530041 is an apocalyptic number.
147365443530041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
147365443530041 is a deficient number, since it is larger than the sum of its proper divisors (14726388416311).
147365443530041 is a wasteful number, since it uses less digits than its factorization.
147365443530041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 839351044 (or 839351033 counting only the distinct ones).
The product of its (nonzero) digits is 7257600, while the sum is 50.
The spelling of 147365443530041 in words is "one hundred forty-seven trillion, three hundred sixty-five billion, four hundred forty-three million, five hundred thirty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •