Base | Representation |
---|---|
bin | 111111111000000… |
… | …1010000101010001 |
3 | 12112101001110220100 |
4 | 1333300022011101 |
5 | 13342143040031 |
6 | 552403003013 |
7 | 104054003244 |
oct | 17760120521 |
9 | 5471043810 |
10 | 2143330641 |
11 | 9aa944041 |
12 | 4b9969469 |
13 | 28207c6aa |
14 | 16492925b |
15 | c8275de6 |
hex | 7fc0a151 |
2143330641 has 24 divisors (see below), whose sum is σ = 3289445640. Its totient is φ = 1344807168.
The previous prime is 2143330639. The next prime is 2143330643. The reversal of 2143330641 is 1460333412.
2143330641 is a `hidden beast` number, since 2 + 14 + 3 + 3 + 3 + 0 + 641 = 666.
It is an interprime number because it is at equal distance from previous prime (2143330639) and next prime (2143330643).
It can be written as a sum of positive squares in 4 ways, for example, as 20793600 + 2122537041 = 4560^2 + 46071^2 .
It is not a de Polignac number, because 2143330641 - 21 = 2143330639 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2143330643) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19981 + ... + 68453.
It is an arithmetic number, because the mean of its divisors is an integer number (137060235).
Almost surely, 22143330641 is an apocalyptic number.
It is an amenable number.
2143330641 is a deficient number, since it is larger than the sum of its proper divisors (1146114999).
2143330641 is an equidigital number, since it uses as much as digits as its factorization.
2143330641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48530 (or 48493 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
The square root of 2143330641 is about 46296.1190706089. The cubic root of 2143330641 is about 1289.3269411219.
The spelling of 2143330641 in words is "two billion, one hundred forty-three million, three hundred thirty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •