Base | Representation |
---|---|
bin | 111100001010011110… |
… | …0010011000101110101 |
3 | 110100111012021211112021 |
4 | 1320110330103011311 |
5 | 4104100243320122 |
6 | 135204232153141 |
7 | 12222464011444 |
oct | 1702474230565 |
9 | 410435254467 |
10 | 129200370037 |
11 | 4a880271322 |
12 | 21058b387b1 |
13 | c2503211cb |
14 | 63791d8d5b |
15 | 3562a611c7 |
hex | 1e14f13175 |
129200370037 has 2 divisors, whose sum is σ = 129200370038. Its totient is φ = 129200370036.
The previous prime is 129200370031. The next prime is 129200370097. The reversal of 129200370037 is 730073002921.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 110233296196 + 18967073841 = 332014^2 + 137721^2 .
It is a cyclic number.
It is not a de Polignac number, because 129200370037 - 23 = 129200370029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 129200369984 and 129200370011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (129200370031) 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, 64600185018 + 64600185019.
It is an arithmetic number, because the mean of its divisors is an integer number (64600185019).
Almost surely, 2129200370037 is an apocalyptic number.
It is an amenable number.
129200370037 is a deficient number, since it is larger than the sum of its proper divisors (1).
129200370037 is an equidigital number, since it uses as much as digits as its factorization.
129200370037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15876, while the sum is 34.
Adding to 129200370037 its reverse (730073002921), we get a palindrome (859273372958).
The spelling of 129200370037 in words is "one hundred twenty-nine billion, two hundred million, three hundred seventy thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •