Base | Representation |
---|---|
bin | 10000110000000… |
… | …01000011111011 |
3 | 100210101211022212 |
4 | 20120001003323 |
5 | 241432413111 |
6 | 21535405335 |
7 | 3324226304 |
oct | 1030010373 |
9 | 323354285 |
10 | 140513531 |
11 | 72352994 |
12 | 3b08384b |
13 | 2315a002 |
14 | 149397ab |
15 | c50898b |
hex | 86010fb |
140513531 has 8 divisors (see below), whose sum is σ = 151907280. Its totient is φ = 129519648.
The previous prime is 140513507. The next prime is 140513533. The reversal of 140513531 is 135315041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140513531 is a prime.
It is a super-2 number, since 2×1405135312 = 39488104788175922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 140513497 and 140513506.
It is not an unprimeable number, because it can be changed into a prime (140513533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 99236 + ... + 100641.
It is an arithmetic number, because the mean of its divisors is an integer number (18988410).
Almost surely, 2140513531 is an apocalyptic number.
140513531 is a deficient number, since it is larger than the sum of its proper divisors (11393749).
140513531 is a wasteful number, since it uses less digits than its factorization.
140513531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 199933.
The product of its (nonzero) digits is 900, while the sum is 23.
The square root of 140513531 is about 11853.8403481741. The cubic root of 140513531 is about 519.8835180417.
Adding to 140513531 its reverse (135315041), we get a palindrome (275828572).
The spelling of 140513531 in words is "one hundred forty million, five hundred thirteen thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •