Base | Representation |
---|---|
bin | 11111000011011110001… |
… | …011110100111110011101 |
3 | 21120000022022121112000102 |
4 | 133003132023310332131 |
5 | 234430444020440331 |
6 | 4312205511310445 |
7 | 310115200534301 |
oct | 37033613647635 |
9 | 7500268545012 |
10 | 2134031421341 |
11 | 753046115496 |
12 | 2a570a97b425 |
13 | 12631370c501 |
14 | 7540552bd01 |
15 | 3a79ec214cb |
hex | 1f0de2f4f9d |
2134031421341 has 4 divisors (see below), whose sum is σ = 2134034687292. Its totient is φ = 2134028155392.
The previous prime is 2134031421329. The next prime is 2134031421349. The reversal of 2134031421341 is 1431241304312.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1265127798841 + 868903622500 = 1124779^2 + 932150^2 .
It is a cyclic number.
It is not a de Polignac number, because 2134031421341 - 214 = 2134031404957 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 (2134031421349) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 278180 + ... + 2084573.
It is an arithmetic number, because the mean of its divisors is an integer number (533508671823).
Almost surely, 22134031421341 is an apocalyptic number.
It is an amenable number.
2134031421341 is a deficient number, since it is larger than the sum of its proper divisors (3265951).
2134031421341 is an equidigital number, since it uses as much as digits as its factorization.
2134031421341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3265950.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 2134031421341 its reverse (1431241304312), we get a palindrome (3565272725653).
The spelling of 2134031421341 in words is "two trillion, one hundred thirty-four billion, thirty-one million, four hundred twenty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •