Base | Representation |
---|---|
bin | 111111111001011… |
… | …0000101101001101 |
3 | 12112102100011002211 |
4 | 1333302300231031 |
5 | 13342331410013 |
6 | 552425350421 |
7 | 104062545103 |
oct | 17762605515 |
9 | 5472304084 |
10 | 2144013133 |
11 | a0026a889 |
12 | 4ba038411 |
13 | 28225b232 |
14 | 164a65c73 |
15 | c835d23d |
hex | 7fcb0b4d |
2144013133 has 4 divisors (see below), whose sum is σ = 2155991040. Its totient is φ = 2132035228.
The previous prime is 2144013107. The next prime is 2144013167. The reversal of 2144013133 is 3313104412.
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 2144013133 - 29 = 2144012621 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 (2144013173) 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, 5988685 + ... + 5989042.
It is an arithmetic number, because the mean of its divisors is an integer number (538997760).
Almost surely, 22144013133 is an apocalyptic number.
It is an amenable number.
2144013133 is a deficient number, since it is larger than the sum of its proper divisors (11977907).
2144013133 is a wasteful number, since it uses less digits than its factorization.
2144013133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11977906.
The product of its (nonzero) digits is 864, while the sum is 22.
The square root of 2144013133 is about 46303.4894257441. The cubic root of 2144013133 is about 1289.4637782983.
Adding to 2144013133 its reverse (3313104412), we get a palindrome (5457117545).
The spelling of 2144013133 in words is "two billion, one hundred forty-four million, thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •