Base | Representation |
---|---|
bin | 1011010001011101… |
… | …00110110011101101 |
3 | 120121202221020022100 |
4 | 11220232212303231 |
5 | 44343303442331 |
6 | 2440311405313 |
7 | 302655165411 |
oct | 55056466355 |
9 | 16552836270 |
10 | 6052015341 |
11 | 2626228779 |
12 | 120a983839 |
13 | 755aab588 |
14 | 415aacd41 |
15 | 2564aeae6 |
hex | 168ba6ced |
6052015341 has 6 divisors (see below), whose sum is σ = 8741799950. Its totient is φ = 4034676888.
The previous prime is 6052015237. The next prime is 6052015441. The reversal of 6052015341 is 1435102506.
6052015341 is a `hidden beast` number, since 605 + 2 + 0 + 1 + 53 + 4 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 3828515625 + 2223499716 = 61875^2 + 47154^2 .
It is not a de Polignac number, because 6052015341 - 211 = 6052013293 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 (6052015441) 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 5 ways as a sum of consecutive naturals, for example, 336223066 + ... + 336223083.
Almost surely, 26052015341 is an apocalyptic number.
It is an amenable number.
6052015341 is a deficient number, since it is larger than the sum of its proper divisors (2689784609).
6052015341 is a wasteful number, since it uses less digits than its factorization.
6052015341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 672446155 (or 672446152 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The square root of 6052015341 is about 77794.6999544313. The cubic root of 6052015341 is about 1822.3564996216.
Adding to 6052015341 its reverse (1435102506), we get a palindrome (7487117847).
The spelling of 6052015341 in words is "six billion, fifty-two million, fifteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •