Base | Representation |
---|---|
bin | 11111111000101011011000… |
… | …111001011000000111011011 |
3 | 200101112021021221210111000022 |
4 | 133320223120321120013123 |
5 | 121340044342202242133 |
6 | 1214130431402101055 |
7 | 41352411131046263 |
oct | 3770533071300733 |
9 | 611467257714008 |
10 | 140234321134043 |
11 | 40757050419434 |
12 | 1388a4264aa78b |
13 | 60330694037c6 |
14 | 268b53d6827a3 |
15 | 1132c3aae5998 |
hex | 7f8ad8e581db |
140234321134043 has 12 divisors (see below), whose sum is σ = 150512070125880. Its totient is φ = 130601811990816.
The previous prime is 140234321134007. The next prime is 140234321134049. The reversal of 140234321134043 is 340431123432041.
It is not a de Polignac number, because 140234321134043 - 26 = 140234321133979 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140234321133994 and 140234321134012.
It is not an unprimeable number, because it can be changed into a prime (140234321134049) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3292018730 + ... + 3292061327.
It is an arithmetic number, because the mean of its divisors is an integer number (12542672510490).
Almost surely, 2140234321134043 is an apocalyptic number.
140234321134043 is a deficient number, since it is larger than the sum of its proper divisors (10277748991837).
140234321134043 is an equidigital number, since it uses as much as digits as its factorization.
140234321134043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6584080154 (or 6584080135 counting only the distinct ones).
The product of its (nonzero) digits is 82944, while the sum is 35.
Adding to 140234321134043 its reverse (340431123432041), we get a palindrome (480665444566084).
The spelling of 140234321134043 in words is "one hundred forty trillion, two hundred thirty-four billion, three hundred twenty-one million, one hundred thirty-four thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •