Base | Representation |
---|---|
bin | 11111111011101011001110… |
… | …111110000110101100010001 |
3 | 200102020221222212220002111120 |
4 | 133323223032332012230101 |
5 | 121401433230114001231 |
6 | 1214405220015232453 |
7 | 41403322610224023 |
oct | 3773531676065421 |
9 | 612227885802446 |
10 | 140440313031441 |
11 | 40826447486855 |
12 | 13902334818729 |
13 | 6049606c126a7 |
14 | 26974c1464013 |
15 | 1138295101d96 |
hex | 7fbacef86b11 |
140440313031441 has 8 divisors (see below), whose sum is σ = 187260482449824. Its totient is φ = 93623509483680.
The previous prime is 140440313031437. The next prime is 140440313031457. The reversal of 140440313031441 is 144130313044041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 140440313031441 - 22 = 140440313031437 is a prime.
It is not an unprimeable number, because it can be changed into a prime (140440313031401) 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 in 7 ways as a sum of consecutive naturals, for example, 841370295 + ... + 841537196.
It is an arithmetic number, because the mean of its divisors is an integer number (23407560306228).
Almost surely, 2140440313031441 is an apocalyptic number.
It is an amenable number.
140440313031441 is a deficient number, since it is larger than the sum of its proper divisors (46820169418383).
140440313031441 is a wasteful number, since it uses less digits than its factorization.
140440313031441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1682935311.
The product of its (nonzero) digits is 27648, while the sum is 33.
Adding to 140440313031441 its reverse (144130313044041), we get a palindrome (284570626075482).
The spelling of 140440313031441 in words is "one hundred forty trillion, four hundred forty billion, three hundred thirteen million, thirty-one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •