Base | Representation |
---|---|
bin | 1011001011100000… |
… | …00001000011110001 |
3 | 120111021220220100122 |
4 | 11211300001003301 |
5 | 44243011201421 |
6 | 2431324500025 |
7 | 301510416563 |
oct | 54560010361 |
9 | 16437826318 |
10 | 6002053361 |
11 | 2600003587 |
12 | 11b60aa615 |
13 | 748637585 |
14 | 40d1c5333 |
15 | 251de12ab |
hex | 165c010f1 |
6002053361 has 8 divisors (see below), whose sum is σ = 6207352320. Its totient is φ = 5799987648.
The previous prime is 6002053339. The next prime is 6002053363. The reversal of 6002053361 is 1633502006.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6002053361 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 6002053361.
It is not an unprimeable number, because it can be changed into a prime (6002053363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 804536 + ... + 811961.
It is an arithmetic number, because the mean of its divisors is an integer number (775919040).
Almost surely, 26002053361 is an apocalyptic number.
It is an amenable number.
6002053361 is a deficient number, since it is larger than the sum of its proper divisors (205298959).
6002053361 is a wasteful number, since it uses less digits than its factorization.
6002053361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1616623.
The product of its (nonzero) digits is 3240, while the sum is 26.
The square root of 6002053361 is about 77472.9201786018. The cubic root of 6002053361 is about 1817.3278583321.
Adding to 6002053361 its reverse (1633502006), we get a palindrome (7635555367).
The spelling of 6002053361 in words is "six billion, two million, fifty-three thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •