Base | Representation |
---|---|
bin | 11110100010111010001011… |
… | …001000110010011011011101 |
3 | 122121122210211222111102200211 |
4 | 132202322023020302123131 |
5 | 120102012434240433041 |
6 | 1153415031445052421 |
7 | 40203524254105462 |
oct | 3642721310623335 |
9 | 577583758442624 |
10 | 134340321421021 |
11 | 39894457219541 |
12 | 130980799b7111 |
13 | 59c6312a1ca11 |
14 | 252616b799669 |
15 | 107e777a3a481 |
hex | 7a2e8b2326dd |
134340321421021 has 8 divisors (see below), whose sum is σ = 134837374053888. Its totient is φ = 133843278582000.
The previous prime is 134340321421001. The next prime is 134340321421133. The reversal of 134340321421021 is 120124123043431.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 134340321421021 - 29 = 134340321420509 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 (134340321421001) 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, 25630476 + ... + 30423706.
It is an arithmetic number, because the mean of its divisors is an integer number (16854671756736).
Almost surely, 2134340321421021 is an apocalyptic number.
It is an amenable number.
134340321421021 is a deficient number, since it is larger than the sum of its proper divisors (497052632867).
134340321421021 is a wasteful number, since it uses less digits than its factorization.
134340321421021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4896923.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 134340321421021 its reverse (120124123043431), we get a palindrome (254464444464452).
The spelling of 134340321421021 in words is "one hundred thirty-four trillion, three hundred forty billion, three hundred twenty-one million, four hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •