Base | Representation |
---|---|
bin | 1000001010000111110… |
… | …1111001010101000111 |
3 | 111101202201211021221010 |
4 | 2002201331321111013 |
5 | 4244020003421410 |
6 | 144215324053303 |
7 | 13061126662041 |
oct | 2024175712507 |
9 | 441681737833 |
10 | 140156310855 |
11 | 54492646870 |
12 | 231b6094233 |
13 | 102a8090522 |
14 | 6ad82baa91 |
15 | 39a47eac20 |
hex | 20a1f79547 |
140156310855 has 48 divisors (see below), whose sum is σ = 246824263296. Its totient is φ = 67352194560.
The previous prime is 140156310829. The next prime is 140156310863. The reversal of 140156310855 is 558013651041.
It is a happy number.
140156310855 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 140156310855 - 28 = 140156310599 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2073624 + ... + 2140146.
It is an arithmetic number, because the mean of its divisors is an integer number (5142172152).
Almost surely, 2140156310855 is an apocalyptic number.
140156310855 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
140156310855 is a deficient number, since it is larger than the sum of its proper divisors (106667952441).
140156310855 is a wasteful number, since it uses less digits than its factorization.
140156310855 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66768 (or 66655 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 39.
Adding to 140156310855 its reverse (558013651041), we get a palindrome (698169961896).
The spelling of 140156310855 in words is "one hundred forty billion, one hundred fifty-six million, three hundred ten thousand, eight hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •