Base | Representation |
---|---|
bin | 111110100011010110… |
… | …0101111011101100011 |
3 | 110211201200211010121221 |
4 | 1331012230233131203 |
5 | 4200102002320120 |
6 | 141413240355511 |
7 | 12463553116006 |
oct | 1750654573543 |
9 | 424650733557 |
10 | 134330120035 |
11 | 51a7293a431 |
12 | 2204aa75b97 |
13 | c88a00b837 |
14 | 67045d353d |
15 | 37630970aa |
hex | 1f46b2f763 |
134330120035 has 8 divisors (see below), whose sum is σ = 161417876256. Its totient is φ = 107316274560.
The previous prime is 134330120017. The next prime is 134330120047. The reversal of 134330120035 is 530021033431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 134330120035 - 27 = 134330119907 is a prime.
It is a super-2 number, since 2×1343301200352 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 134330119991 and 134330120009.
It is an unprimeable number.
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, 18473686 + ... + 18480955.
It is an arithmetic number, because the mean of its divisors is an integer number (20177234532).
Almost surely, 2134330120035 is an apocalyptic number.
134330120035 is a deficient number, since it is larger than the sum of its proper divisors (27087756221).
134330120035 is an equidigital number, since it uses as much as digits as its factorization.
134330120035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36955373.
The product of its (nonzero) digits is 3240, while the sum is 25.
Adding to 134330120035 its reverse (530021033431), we get a palindrome (664351153466).
The spelling of 134330120035 in words is "one hundred thirty-four billion, three hundred thirty million, one hundred twenty thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •