Base | Representation |
---|---|
bin | 11101010110000110010010… |
… | …111001001110010010000101 |
3 | 121220222012102021111211222021 |
4 | 131112012102321032102011 |
5 | 113404022321302023444 |
6 | 1134254122451003141 |
7 | 36120263051515621 |
oct | 3526062271162205 |
9 | 556865367454867 |
10 | 129061936751749 |
11 | 38139950727681 |
12 | 125850995994b1 |
13 | 57026470775a1 |
14 | 23c28b991c181 |
15 | edc2e5602584 |
hex | 756192e4e485 |
129061936751749 has 8 divisors (see below), whose sum is σ = 129361177888448. Its totient is φ = 128762769108960.
The previous prime is 129061936751747. The next prime is 129061936751849. The reversal of 129061936751749 is 947157639160921.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 129061936751749 - 21 = 129061936751747 is a prime.
It is a super-2 number, since 2×1290619367517492 (a number of 29 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 (129061936751747) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14856447 + ... + 21882364.
It is an arithmetic number, because the mean of its divisors is an integer number (16170147236056).
Almost surely, 2129061936751749 is an apocalyptic number.
It is an amenable number.
129061936751749 is a deficient number, since it is larger than the sum of its proper divisors (299241136699).
129061936751749 is an equidigital number, since it uses as much as digits as its factorization.
129061936751749 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36746955.
The product of its (nonzero) digits is 154314720, while the sum is 70.
The spelling of 129061936751749 in words is "one hundred twenty-nine trillion, sixty-one billion, nine hundred thirty-six million, seven hundred fifty-one thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •