Base | Representation |
---|---|
bin | 1011010001011111… |
… | …00100010110001101 |
3 | 120121210102001002001 |
4 | 11220233210112031 |
5 | 44343340024110 |
6 | 2440321032301 |
7 | 302660265322 |
oct | 55057442615 |
9 | 16553361061 |
10 | 6052267405 |
11 | 2626390098 |
12 | 120aa85691 |
13 | 755b69222 |
14 | 415b36b49 |
15 | 25650e63a |
hex | 168be458d |
6052267405 has 4 divisors (see below), whose sum is σ = 7262720892. Its totient is φ = 4841813920.
The previous prime is 6052267387. The next prime is 6052267411. The reversal of 6052267405 is 5047622506.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5047622506 = 2 ⋅2523811253.
It can be written as a sum of positive squares in 2 ways, for example, as 1535620969 + 4516646436 = 39187^2 + 67206^2 .
It is not a de Polignac number, because 6052267405 - 221 = 6050170253 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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, 605226736 + ... + 605226745.
It is an arithmetic number, because the mean of its divisors is an integer number (1815680223).
Almost surely, 26052267405 is an apocalyptic number.
It is an amenable number.
6052267405 is a deficient number, since it is larger than the sum of its proper divisors (1210453487).
6052267405 is a wasteful number, since it uses less digits than its factorization.
6052267405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1210453486.
The product of its (nonzero) digits is 100800, while the sum is 37.
The square root of 6052267405 is about 77796.3199965140. The cubic root of 6052267405 is about 1822.3817994083.
The spelling of 6052267405 in words is "six billion, fifty-two million, two hundred sixty-seven thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •