Base | Representation |
---|---|
bin | 1011010001100111… |
… | …11100001001010101 |
3 | 120121212120021011120 |
4 | 11220303330021111 |
5 | 44344133212321 |
6 | 2440401354153 |
7 | 303003110514 |
oct | 55063741125 |
9 | 16555507146 |
10 | 6053413461 |
11 | 2626aa3147 |
12 | 120b338959 |
13 | 75617aa74 |
14 | 415d5467b |
15 | 256688ec6 |
hex | 168cfc255 |
6053413461 has 4 divisors (see below), whose sum is σ = 8071217952. Its totient is φ = 4035608972.
The previous prime is 6053413423. The next prime is 6053413469. The reversal of 6053413461 is 1643143506.
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 6053413461 - 219 = 6052889173 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6053413469) 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, 1008902241 + ... + 1008902246.
It is an arithmetic number, because the mean of its divisors is an integer number (2017804488).
Almost surely, 26053413461 is an apocalyptic number.
It is an amenable number.
6053413461 is a deficient number, since it is larger than the sum of its proper divisors (2017804491).
6053413461 is a wasteful number, since it uses less digits than its factorization.
6053413461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2017804490.
The product of its (nonzero) digits is 25920, while the sum is 33.
The square root of 6053413461 is about 77803.6853947164. The cubic root of 6053413461 is about 1822.4968207516.
Adding to 6053413461 its reverse (1643143506), we get a palindrome (7696556967).
The spelling of 6053413461 in words is "six billion, fifty-three million, four hundred thirteen thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.853 sec. • engine limits •