Base | Representation |
---|---|
bin | 1001011001011011… |
… | …01100011001100101 |
3 | 111000121022211022101 |
4 | 10230231230121211 |
5 | 40313024040031 |
6 | 2152342532101 |
7 | 236011003063 |
oct | 45455543145 |
9 | 14017284271 |
10 | 5045143141 |
11 | 2159940795 |
12 | b89737031 |
13 | 6253063cc |
14 | 35c093033 |
15 | 1e7dc2361 |
hex | 12cb6c665 |
5045143141 has 4 divisors (see below), whose sum is σ = 5069053984. Its totient is φ = 5021232300.
The previous prime is 5045143123. The next prime is 5045143157. The reversal of 5045143141 is 1413415405.
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 5045143141 - 213 = 5045134949 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 (5045143171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11955105 + ... + 11955526.
It is an arithmetic number, because the mean of its divisors is an integer number (1267263496).
Almost surely, 25045143141 is an apocalyptic number.
It is an amenable number.
5045143141 is a deficient number, since it is larger than the sum of its proper divisors (23910843).
5045143141 is a wasteful number, since it uses less digits than its factorization.
5045143141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23910842.
The product of its (nonzero) digits is 4800, while the sum is 28.
The square root of 5045143141 is about 71029.1710566863. The cubic root of 5045143141 is about 1715.1067817359.
Adding to 5045143141 its reverse (1413415405), we get a palindrome (6458558546).
The spelling of 5045143141 in words is "five billion, forty-five million, one hundred forty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •