Base | Representation |
---|---|
bin | 11110100100010010011101… |
… | …100110000011111001000001 |
3 | 122121222212112200102202112112 |
4 | 132210102131212003321001 |
5 | 120110041111303140441 |
6 | 1153530350335305105 |
7 | 40213421414613632 |
oct | 3644223546037101 |
9 | 577885480382475 |
10 | 134435120365121 |
11 | 39920683803334 |
12 | 130b251597b195 |
13 | 5a0223cb36a94 |
14 | 252a9a1b7d889 |
15 | 1081e753564eb |
hex | 7a449d983e41 |
134435120365121 has 8 divisors (see below), whose sum is σ = 134770902482400. Its totient is φ = 134099340897600.
The previous prime is 134435120365111. The next prime is 134435120365127. The reversal of 134435120365121 is 121563021534431.
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-134435120365121 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (134435120365127) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 136176590 + ... + 137160248.
It is an arithmetic number, because the mean of its divisors is an integer number (16846362810300).
Almost surely, 2134435120365121 is an apocalyptic number.
It is an amenable number.
134435120365121 is a deficient number, since it is larger than the sum of its proper divisors (335782117279).
134435120365121 is an equidigital number, since it uses as much as digits as its factorization.
134435120365121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1324879.
The product of its (nonzero) digits is 259200, while the sum is 41.
Adding to 134435120365121 its reverse (121563021534431), we get a palindrome (255998141899552).
The spelling of 134435120365121 in words is "one hundred thirty-four trillion, four hundred thirty-five billion, one hundred twenty million, three hundred sixty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •