Base | Representation |
---|---|
bin | 1011010001010111… |
… | …11101110100000001 |
3 | 120121201122001210011 |
4 | 11220223331310001 |
5 | 44343114320022 |
6 | 2440244504521 |
7 | 302646253336 |
oct | 55053756401 |
9 | 16551561704 |
10 | 6051323137 |
11 | 26258a5702 |
12 | 120a6ab141 |
13 | 7558c84a2 |
14 | 41596c98d |
15 | 2563c4977 |
hex | 168afdd01 |
6051323137 has 4 divisors (see below), whose sum is σ = 6051801520. Its totient is φ = 6050844756.
The previous prime is 6051323021. The next prime is 6051323147. The reversal of 6051323137 is 7313231506.
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 6051323137 - 227 = 5917105409 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6051323099 and 6051323108.
It is not an unprimeable number, because it can be changed into a prime (6051323147) 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, 219687 + ... + 245692.
It is an arithmetic number, because the mean of its divisors is an integer number (1512950380).
Almost surely, 26051323137 is an apocalyptic number.
It is an amenable number.
6051323137 is a deficient number, since it is larger than the sum of its proper divisors (478383).
6051323137 is a wasteful number, since it uses less digits than its factorization.
6051323137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 478382.
The product of its (nonzero) digits is 11340, while the sum is 31.
The square root of 6051323137 is about 77790.2509123091. The cubic root of 6051323137 is about 1822.2870191548.
The spelling of 6051323137 in words is "six billion, fifty-one million, three hundred twenty-three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •