Base | Representation |
---|---|
bin | 1000000110100100000… |
… | …1011001111011111011 |
3 | 111022022011002220010122 |
4 | 2001221001121323323 |
5 | 4240040414221111 |
6 | 143540435003455 |
7 | 13025346243536 |
oct | 2015101317373 |
9 | 438264086118 |
10 | 139200929531 |
11 | 54042328724 |
12 | 22b8a13958b |
13 | 10185176231 |
14 | 6a47465a1d |
15 | 394a9cecdb |
hex | 2069059efb |
139200929531 has 2 divisors, whose sum is σ = 139200929532. Its totient is φ = 139200929530.
The previous prime is 139200929503. The next prime is 139200929561. The reversal of 139200929531 is 135929002931.
139200929531 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 139200929531 - 26 = 139200929467 is a prime.
It is a super-2 number, since 2×1392009295312 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (139200929561) 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 as a sum of consecutive naturals, namely, 69600464765 + 69600464766.
It is an arithmetic number, because the mean of its divisors is an integer number (69600464766).
Almost surely, 2139200929531 is an apocalyptic number.
139200929531 is a deficient number, since it is larger than the sum of its proper divisors (1).
139200929531 is an equidigital number, since it uses as much as digits as its factorization.
139200929531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 131220, while the sum is 44.
The spelling of 139200929531 in words is "one hundred thirty-nine billion, two hundred million, nine hundred twenty-nine thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •