Base | Representation |
---|---|
bin | 11111110111000011110000… |
… | …010001010011010110011011 |
3 | 200101010122001212111002111120 |
4 | 133313003300101103112123 |
5 | 121331233443244213001 |
6 | 1214003345433500323 |
7 | 41341361442122445 |
oct | 3767036021232633 |
9 | 611118055432446 |
10 | 140123044132251 |
11 | 40713938459a44 |
12 | 1387094bb716a3 |
13 | 602571449194b |
14 | 2685dc4a47495 |
15 | 112edc6852236 |
hex | 7f70f045359b |
140123044132251 has 8 divisors (see below), whose sum is σ = 186889274793984. Its totient is φ = 93386088112680.
The previous prime is 140123044132223. The next prime is 140123044132259. The reversal of 140123044132251 is 152231440321041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 140123044132251 - 217 = 140123044001179 is a prime.
It is a super-2 number, since 2×1401230441322512 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (140123044132259) 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, 7318649371 + ... + 7318668516.
It is an arithmetic number, because the mean of its divisors is an integer number (23361159349248).
Almost surely, 2140123044132251 is an apocalyptic number.
140123044132251 is a deficient number, since it is larger than the sum of its proper divisors (46766230661733).
140123044132251 is a wasteful number, since it uses less digits than its factorization.
140123044132251 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14637321081.
The product of its (nonzero) digits is 23040, while the sum is 33.
Adding to 140123044132251 its reverse (152231440321041), we get a palindrome (292354484453292).
The spelling of 140123044132251 in words is "one hundred forty trillion, one hundred twenty-three billion, forty-four million, one hundred thirty-two thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •