Base | Representation |
---|---|
bin | 111100000110010010… |
… | …1000101111011001101 |
3 | 110100010102021210210010 |
4 | 1320030211011323031 |
5 | 4103303334202234 |
6 | 135142301103433 |
7 | 12216141325641 |
oct | 1701445057315 |
9 | 410112253703 |
10 | 129060069069 |
11 | 4a809054108 |
12 | 21019b57b79 |
13 | c22a239b99 |
14 | 6364716c21 |
15 | 355559a6e9 |
hex | 1e0c945ecd |
129060069069 has 4 divisors (see below), whose sum is σ = 172080092096. Its totient is φ = 86040046044.
The previous prime is 129060069013. The next prime is 129060069137. The reversal of 129060069069 is 960960060921.
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 not a de Polignac number, because 129060069069 - 211 = 129060067021 is a prime.
It is a super-2 number, since 2×1290600690692 (a number of 23 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 (129060069469) 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, 21510011509 + ... + 21510011514.
It is an arithmetic number, because the mean of its divisors is an integer number (43020023024).
Almost surely, 2129060069069 is an apocalyptic number.
It is an amenable number.
129060069069 is a deficient number, since it is larger than the sum of its proper divisors (43020023027).
129060069069 is an equidigital number, since it uses as much as digits as its factorization.
129060069069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43020023026.
The product of its (nonzero) digits is 314928, while the sum is 48.
The spelling of 129060069069 in words is "one hundred twenty-nine billion, sixty million, sixty-nine thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •