Base | Representation |
---|---|
bin | 111111111101101… |
… | …0000101010010101 |
3 | 12112120112100101211 |
4 | 1333323100222111 |
5 | 13343414204143 |
6 | 552545221421 |
7 | 104120514616 |
oct | 17773205225 |
9 | 5476470354 |
10 | 2146241173 |
11 | a0155183a |
12 | 4ba931871 |
13 | 28285b3bb |
14 | 165085c0d |
15 | c864d49d |
hex | 7fed0a95 |
2146241173 has 4 divisors (see below), whose sum is σ = 2147750848. Its totient is φ = 2144731500.
The previous prime is 2146241161. The next prime is 2146241183. The reversal of 2146241173 is 3711426412.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2146241173 - 213 = 2146232981 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 (2146241183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 752703 + ... + 755548.
It is an arithmetic number, because the mean of its divisors is an integer number (536937712).
Almost surely, 22146241173 is an apocalyptic number.
It is an amenable number.
2146241173 is a deficient number, since it is larger than the sum of its proper divisors (1509675).
2146241173 is a wasteful number, since it uses less digits than its factorization.
2146241173 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1509674.
The product of its digits is 8064, while the sum is 31.
The square root of 2146241173 is about 46327.5422723891. The cubic root of 2146241173 is about 1289.9102902180.
Adding to 2146241173 its reverse (3711426412), we get a palindrome (5857667585).
The spelling of 2146241173 in words is "two billion, one hundred forty-six million, two hundred forty-one thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •