Base | Representation |
---|---|
bin | 11111111000101011100000… |
… | …000111101011100101001111 |
3 | 200101112021121101211120210110 |
4 | 133320223200013223211033 |
5 | 121340100114213334203 |
6 | 1214130451411411103 |
7 | 41352414132125535 |
oct | 3770534007534517 |
9 | 611467541746713 |
10 | 140234442324303 |
11 | 40757102873478 |
12 | 1388a45abb3a93 |
13 | 6033088556412 |
14 | 268b5517cc155 |
15 | 1132c46583d03 |
hex | 7f8ae01eb94f |
140234442324303 has 8 divisors (see below), whose sum is σ = 192032749849648. Its totient is φ = 90962881507584.
The previous prime is 140234442324281. The next prime is 140234442324329. The reversal of 140234442324303 is 303423244432041.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 140234442324303 - 212 = 140234442320207 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140234442324803) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 631686677026 + ... + 631686677247.
It is an arithmetic number, because the mean of its divisors is an integer number (24004093731206).
Almost surely, 2140234442324303 is an apocalyptic number.
140234442324303 is a deficient number, since it is larger than the sum of its proper divisors (51798307525345).
140234442324303 is a wasteful number, since it uses less digits than its factorization.
140234442324303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1263373354313.
The product of its (nonzero) digits is 663552, while the sum is 39.
Adding to 140234442324303 its reverse (303423244432041), we get a palindrome (443657686756344).
The spelling of 140234442324303 in words is "one hundred forty trillion, two hundred thirty-four billion, four hundred forty-two million, three hundred twenty-four thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •