Base | Representation |
---|---|
bin | 11110100101011010010000… |
… | …000101100011001010101111 |
3 | 122122021020111201021221200222 |
4 | 132211122100011203022233 |
5 | 120112321443001244444 |
6 | 1154030015243041555 |
7 | 40222120534515113 |
oct | 3645322005431257 |
9 | 578236451257628 |
10 | 134512203149999 |
11 | 39950339a52524 |
12 | 131054488102bb |
13 | 5a095a57811ac |
14 | 25305d5301743 |
15 | 1083e87684eee |
hex | 7a56901632af |
134512203149999 has 8 divisors (see below), whose sum is σ = 136393170557520. Its totient is φ = 132632271809856.
The previous prime is 134512203149977. The next prime is 134512203150007. The reversal of 134512203149999 is 999941302215431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134512203149999 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 (134512203149399) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 258755369 + ... + 259274690.
It is an arithmetic number, because the mean of its divisors is an integer number (17049146319690).
Almost surely, 2134512203149999 is an apocalyptic number.
134512203149999 is a deficient number, since it is larger than the sum of its proper divisors (1880967407521).
134512203149999 is an equidigital number, since it uses as much as digits as its factorization.
134512203149999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 518033689.
The product of its (nonzero) digits is 18895680, while the sum is 62.
The spelling of 134512203149999 in words is "one hundred thirty-four trillion, five hundred twelve billion, two hundred three million, one hundred forty-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •