Base | Representation |
---|---|
bin | 11111110111010100011111… |
… | …111010001000110010110011 |
3 | 200101012100110212100011020021 |
4 | 133313110133322020302303 |
5 | 121332032303422012001 |
6 | 1214015521452224311 |
7 | 41342566125021403 |
oct | 3767243772106263 |
9 | 611170425304207 |
10 | 140141023235251 |
11 | 40720524169155 |
12 | 1387432916b097 |
13 | 602731b28672c |
14 | 2686c0c794803 |
15 | 11305c9e7dba1 |
hex | 7f751fe88cb3 |
140141023235251 has 4 divisors (see below), whose sum is σ = 140141059949104. Its totient is φ = 140140986521400.
The previous prime is 140141023235221. The next prime is 140141023235267. The reversal of 140141023235251 is 152532320141041.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 140141023235251 - 213 = 140141023227059 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140141023235221) 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 3 ways as a sum of consecutive naturals, for example, 11866260 + ... + 20520481.
It is an arithmetic number, because the mean of its divisors is an integer number (35035264987276).
Almost surely, 2140141023235251 is an apocalyptic number.
140141023235251 is a deficient number, since it is larger than the sum of its proper divisors (36713853).
140141023235251 is an equidigital number, since it uses as much as digits as its factorization.
140141023235251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36713852.
The product of its (nonzero) digits is 28800, while the sum is 34.
Adding to 140141023235251 its reverse (152532320141041), we get a palindrome (292673343376292).
The spelling of 140141023235251 in words is "one hundred forty trillion, one hundred forty-one billion, twenty-three million, two hundred thirty-five thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •