Base | Representation |
---|---|
bin | 1000001010000110100… |
… | …0000111111000101111 |
3 | 111101202100002022122121 |
4 | 2002201220013320233 |
5 | 4244012023301221 |
6 | 144215001453411 |
7 | 13061030321005 |
oct | 2024150077057 |
9 | 441670068577 |
10 | 140150603311 |
11 | 5448a3a8694 |
12 | 231b41a1267 |
13 | 102a6b42694 |
14 | 6ad7632a75 |
15 | 39a406ea41 |
hex | 20a1a07e2f |
140150603311 has 4 divisors (see below), whose sum is σ = 140164474624. Its totient is φ = 140136732000.
The previous prime is 140150603303. The next prime is 140150603321. The reversal of 140150603311 is 113306051041.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 113306051041 = 4783 ⋅23689327.
It is a cyclic number.
It is not a de Polignac number, because 140150603311 - 23 = 140150603303 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 (140150603321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6920490 + ... + 6940711.
It is an arithmetic number, because the mean of its divisors is an integer number (35041118656).
Almost surely, 2140150603311 is an apocalyptic number.
140150603311 is a deficient number, since it is larger than the sum of its proper divisors (13871313).
140150603311 is a wasteful number, since it uses less digits than its factorization.
140150603311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13871312.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 140150603311 its reverse (113306051041), we get a palindrome (253456654352).
The spelling of 140150603311 in words is "one hundred forty billion, one hundred fifty million, six hundred three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •