Base | Representation |
---|---|
bin | 11111111010000100100010… |
… | …010000100010000011101000 |
3 | 200101212102100212000201210011 |
4 | 133322010202100202003220 |
5 | 121343131411023040402 |
6 | 1214242421515501304 |
7 | 41362340145263233 |
oct | 3772044220420350 |
9 | 611772325021704 |
10 | 140330041221352 |
11 | 407936aa966804 |
12 | 138a4a9aa57834 |
13 | 603c0b2307b18 |
14 | 269202012841a |
15 | 113548e217ed7 |
hex | 7fa1224220e8 |
140330041221352 has 8 divisors (see below), whose sum is σ = 263118827290050. Its totient is φ = 70165020610672.
The previous prime is 140330041221263. The next prime is 140330041221353. The reversal of 140330041221352 is 253122140033041.
It can be written as a sum of positive squares in only one way, i.e., 99833948989636 + 40496092231716 = 9991694^2 + 6363654^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is not an unprimeable number, because it can be changed into a prime (140330041221353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8770627576327 + ... + 8770627576342.
Almost surely, 2140330041221352 is an apocalyptic number.
It is an amenable number.
140330041221352 is a deficient number, since it is larger than the sum of its proper divisors (122788786068698).
140330041221352 is a wasteful number, since it uses less digits than its factorization.
140330041221352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17541255152675 (or 17541255152671 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 140330041221352 its reverse (253122140033041), we get a palindrome (393452181254393).
The spelling of 140330041221352 in words is "one hundred forty trillion, three hundred thirty billion, forty-one million, two hundred twenty-one thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •