Base | Representation |
---|---|
bin | 11110100100001110000000… |
… | …001100101011010110010011 |
3 | 122121222102011222122222212212 |
4 | 132210032000030223112103 |
5 | 120110001310021020220 |
6 | 1153524235252342335 |
7 | 40213161644123531 |
oct | 3644160014532623 |
9 | 577872158588785 |
10 | 134430332204435 |
11 | 39919646a35343 |
12 | 130b15ba3149ab |
13 | 5a01958b492c7 |
14 | 252a669ca3151 |
15 | 1081c94ce70c5 |
hex | 7a438032b593 |
134430332204435 has 4 divisors (see below), whose sum is σ = 161316398645328. Its totient is φ = 107544265763544.
The previous prime is 134430332204411. The next prime is 134430332204447. The reversal of 134430332204435 is 534402233034431.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 134430332204435 - 220 = 134430331155859 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 134430332204392 and 134430332204401.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13443033220439 + ... + 13443033220448.
It is an arithmetic number, because the mean of its divisors is an integer number (40329099661332).
Almost surely, 2134430332204435 is an apocalyptic number.
134430332204435 is a deficient number, since it is larger than the sum of its proper divisors (26886066440893).
134430332204435 is an equidigital number, since it uses as much as digits as its factorization.
134430332204435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26886066440892.
The product of its (nonzero) digits is 1244160, while the sum is 41.
Adding to 134430332204435 its reverse (534402233034431), we get a palindrome (668832565238866).
The spelling of 134430332204435 in words is "one hundred thirty-four trillion, four hundred thirty billion, three hundred thirty-two million, two hundred four thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •