Base | Representation |
---|---|
bin | 1011011100100011… |
… | …10100100111110011 |
3 | 120212021011002210010 |
4 | 11232101310213303 |
5 | 100041123224133 |
6 | 2453435310003 |
7 | 305165524530 |
oct | 55621644763 |
9 | 16767132703 |
10 | 6145133043 |
11 | 2673849455 |
12 | 1235bab303 |
13 | 76c1825ca |
14 | 4241cbd87 |
15 | 25e755263 |
hex | 16e4749f3 |
6145133043 has 8 divisors (see below), whose sum is σ = 9364012288. Its totient is φ = 3511504584.
The previous prime is 6145133011. The next prime is 6145133063. The reversal of 6145133043 is 3403315416.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6145133043 - 25 = 6145133011 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 6145133043.
It is not an unprimeable number, because it can be changed into a prime (6145133063) 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 7 ways as a sum of consecutive naturals, for example, 146312671 + ... + 146312712.
It is an arithmetic number, because the mean of its divisors is an integer number (1170501536).
Almost surely, 26145133043 is an apocalyptic number.
6145133043 is a deficient number, since it is larger than the sum of its proper divisors (3218879245).
6145133043 is a wasteful number, since it uses less digits than its factorization.
6145133043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 292625393.
The product of its (nonzero) digits is 12960, while the sum is 30.
The square root of 6145133043 is about 78390.8989806853. The cubic root of 6145133043 is about 1831.6553688786.
Adding to 6145133043 its reverse (3403315416), we get a palindrome (9548448459).
The spelling of 6145133043 in words is "six billion, one hundred forty-five million, one hundred thirty-three thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •