Base | Representation |
---|---|
bin | 111100001010111110… |
… | …1000010000101011101 |
3 | 110100112101012222120211 |
4 | 1320111331002011131 |
5 | 4104114114332431 |
6 | 135210040012421 |
7 | 12223061160010 |
oct | 1702575020535 |
9 | 410471188524 |
10 | 129217339741 |
11 | 4a889901976 |
12 | 21062761111 |
13 | c2539b3259 |
14 | 637b575377 |
15 | 35642b42b1 |
hex | 1e15f4215d |
129217339741 has 4 divisors (see below), whose sum is σ = 147676959712. Its totient is φ = 110757719772.
The previous prime is 129217339709. The next prime is 129217339763. The reversal of 129217339741 is 147933712921.
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, and also an emirpimes, since its reverse is a distinct semiprime: 147933712921 = 17 ⋅8701983113.
It is not a de Polignac number, because 129217339741 - 25 = 129217339709 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (129217339781) 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 in 3 ways as a sum of consecutive naturals, for example, 9229809975 + ... + 9229809988.
It is an arithmetic number, because the mean of its divisors is an integer number (36919239928).
Almost surely, 2129217339741 is an apocalyptic number.
It is an amenable number.
129217339741 is a deficient number, since it is larger than the sum of its proper divisors (18459619971).
129217339741 is an equidigital number, since it uses as much as digits as its factorization.
129217339741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18459619970.
The product of its digits is 571536, while the sum is 49.
The spelling of 129217339741 in words is "one hundred twenty-nine billion, two hundred seventeen million, three hundred thirty-nine thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •