Base | Representation |
---|---|
bin | 11111110111001011001100… |
… | …010001011001010010111111 |
3 | 200101011101200102111212102221 |
4 | 133313023030101121102333 |
5 | 121331401322202031143 |
6 | 1214011150113030211 |
7 | 41342063362615531 |
oct | 3767131421312277 |
9 | 611141612455387 |
10 | 140131030111423 |
11 | 4071726632032a |
12 | 138723ba555367 |
13 | 60263b7b36000 |
14 | 2686541501851 |
15 | 11301e29cd2ed |
hex | 7f72cc4594bf |
140131030111423 has 16 divisors (see below), whose sum is σ = 151980436127520. Its totient is φ = 129200782870848.
The previous prime is 140131030111421. The next prime is 140131030111427. The reversal of 140131030111423 is 324111030131041.
It is not a de Polignac number, because 140131030111423 - 21 = 140131030111421 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140131030111421) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 35330065 + ... + 39095722.
It is an arithmetic number, because the mean of its divisors is an integer number (9498777257970).
Almost surely, 2140131030111423 is an apocalyptic number.
140131030111423 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
140131030111423 is a deficient number, since it is larger than the sum of its proper divisors (11849406016097).
140131030111423 is an frugal number, since it uses more digits than its factorization.
140131030111423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74426683 (or 74426657 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 140131030111423 its reverse (324111030131041), we get a palindrome (464242060242464).
The spelling of 140131030111423 in words is "one hundred forty trillion, one hundred thirty-one billion, thirty million, one hundred eleven thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •