Base | Representation |
---|---|
bin | 1000001010000001111… |
… | …1110101000111010101 |
3 | 111101201000102111102011 |
4 | 2002200133311013111 |
5 | 4243442200331203 |
6 | 144213043344221 |
7 | 13060410250351 |
oct | 2024037650725 |
9 | 441630374364 |
10 | 140131652053 |
11 | 5447a734298 |
12 | 231a9982071 |
13 | 102a2c38713 |
14 | 6ad4cdc461 |
15 | 39a257976d |
hex | 20a07f51d5 |
140131652053 has 4 divisors (see below), whose sum is σ = 140447976768. Its totient is φ = 139815327340.
The previous prime is 140131652027. The next prime is 140131652077. The reversal of 140131652053 is 350256131041.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140131652053 is a prime.
It is a super-2 number, since 2×1401316520532 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140131656053) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 158161693 + ... + 158162578.
It is an arithmetic number, because the mean of its divisors is an integer number (35111994192).
Almost surely, 2140131652053 is an apocalyptic number.
It is an amenable number.
140131652053 is a deficient number, since it is larger than the sum of its proper divisors (316324715).
140131652053 is an equidigital number, since it uses as much as digits as its factorization.
140131652053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 316324714.
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 140131652053 its reverse (350256131041), we get a palindrome (490387783094).
The spelling of 140131652053 in words is "one hundred forty billion, one hundred thirty-one million, six hundred fifty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.163 sec. • engine limits •