Base | Representation |
---|---|
bin | 111111110111100… |
… | …0100010110111101 |
3 | 12112100111222011000 |
4 | 1333233010112331 |
5 | 13342104420203 |
6 | 552352520513 |
7 | 104051403522 |
oct | 17757042675 |
9 | 5470458130 |
10 | 2143045053 |
11 | 9aa769516 |
12 | 4b9850139 |
13 | 281cac6c6 |
14 | 164893149 |
15 | c821b4a3 |
hex | 7fbc45bd |
2143045053 has 8 divisors (see below), whose sum is σ = 3174881600. Its totient is φ = 1428696684.
The previous prime is 2143045027. The next prime is 2143045057. The reversal of 2143045053 is 3505403412.
It is not a de Polignac number, because 2143045053 - 28 = 2143044797 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 79372039 = 2143045053 / (2 + 1 + 4 + 3 + 0 + 4 + 5 + 0 + 5 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2143045057) 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, 39685993 + ... + 39686046.
It is an arithmetic number, because the mean of its divisors is an integer number (396860200).
Almost surely, 22143045053 is an apocalyptic number.
It is an amenable number.
2143045053 is a deficient number, since it is larger than the sum of its proper divisors (1031836547).
2143045053 is an equidigital number, since it uses as much as digits as its factorization.
2143045053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79372048 (or 79372042 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 27.
The square root of 2143045053 is about 46293.0346056510. The cubic root of 2143045053 is about 1289.2696731405.
Adding to 2143045053 its reverse (3505403412), we get a palindrome (5648448465).
The spelling of 2143045053 in words is "two billion, one hundred forty-three million, forty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •