Base | Representation |
---|---|
bin | 11111111011101011010101… |
… | …000000111101001111001011 |
3 | 200102020222020221201022020121 |
4 | 133323223111000331033023 |
5 | 121401433432044124233 |
6 | 1214405234041004111 |
7 | 41403325251213643 |
oct | 3773532500751713 |
9 | 612228227638217 |
10 | 140440414442443 |
11 | 408264997513a5 |
12 | 13902362783637 |
13 | 6049621c2b4bb |
14 | 26974d0b01523 |
15 | 113829de8492d |
hex | 7fbad503d3cb |
140440414442443 has 2 divisors, whose sum is σ = 140440414442444. Its totient is φ = 140440414442442.
The previous prime is 140440414442351. The next prime is 140440414442479. The reversal of 140440414442443 is 344244414044041.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 140440414442443 - 217 = 140440414311371 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 140440414442443.
It is not a weakly prime, because it can be changed into another prime (140440414446443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70220207221221 + 70220207221222.
It is an arithmetic number, because the mean of its divisors is an integer number (70220207221222).
Almost surely, 2140440414442443 is an apocalyptic number.
140440414442443 is a deficient number, since it is larger than the sum of its proper divisors (1).
140440414442443 is an equidigital number, since it uses as much as digits as its factorization.
140440414442443 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1572864, while the sum is 43.
Adding to 140440414442443 its reverse (344244414044041), we get a palindrome (484684828486484).
The spelling of 140440414442443 in words is "one hundred forty trillion, four hundred forty billion, four hundred fourteen million, four hundred forty-two thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •