Base | Representation |
---|---|
bin | 1000001010000110011… |
… | …1101110110000111101 |
3 | 111101202022220002111120 |
4 | 2002201213232300331 |
5 | 4244012012003123 |
6 | 144214555341153 |
7 | 13061026412010 |
oct | 2024147566075 |
9 | 441668802446 |
10 | 140150500413 |
11 | 5448a338350 |
12 | 231b41517b9 |
13 | 102a6b078b1 |
14 | 6ad7607377 |
15 | 39a404e2e3 |
hex | 20a19eec3d |
140150500413 has 48 divisors (see below), whose sum is σ = 245884939776. Its totient is φ = 68973547680.
The previous prime is 140150500397. The next prime is 140150500421. The reversal of 140150500413 is 314005051041.
It is a happy number.
140150500413 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 140150500413 - 24 = 140150500397 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140150500463) by changing a digit.
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, 756931 + ... + 923712.
It is an arithmetic number, because the mean of its divisors is an integer number (5122602912).
Almost surely, 2140150500413 is an apocalyptic number.
It is an amenable number.
140150500413 is a deficient number, since it is larger than the sum of its proper divisors (105734439363).
140150500413 is a wasteful number, since it uses less digits than its factorization.
140150500413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1680702 (or 1680683 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 24.
Adding to 140150500413 its reverse (314005051041), we get a palindrome (454155551454).
The spelling of 140150500413 in words is "one hundred forty billion, one hundred fifty million, five hundred thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •