Base | Representation |
---|---|
bin | 1000000110100100000… |
… | …1011001111011110001 |
3 | 111022022011002220010021 |
4 | 2001221001121323301 |
5 | 4240040414221041 |
6 | 143540435003441 |
7 | 13025346243523 |
oct | 2015101317361 |
9 | 438264086107 |
10 | 139200929521 |
11 | 54042328715 |
12 | 22b8a139581 |
13 | 10185176224 |
14 | 6a47465a13 |
15 | 394a9cecd1 |
hex | 2069059ef1 |
139200929521 has 4 divisors (see below), whose sum is σ = 145253143872. Its totient is φ = 133148715172.
The previous prime is 139200929503. The next prime is 139200929531. The reversal of 139200929521 is 125929002931.
It is a happy number.
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 not a de Polignac number, because 139200929521 - 29 = 139200929009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (139200929531) 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, 3026107141 + ... + 3026107186.
It is an arithmetic number, because the mean of its divisors is an integer number (36313285968).
Almost surely, 2139200929521 is an apocalyptic number.
It is an amenable number.
139200929521 is a deficient number, since it is larger than the sum of its proper divisors (6052214351).
139200929521 is an equidigital number, since it uses as much as digits as its factorization.
139200929521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6052214350.
The product of its (nonzero) digits is 87480, while the sum is 43.
The spelling of 139200929521 in words is "one hundred thirty-nine billion, two hundred million, nine hundred twenty-nine thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •