Base | Representation |
---|---|
bin | 10111011000110000101001 |
3 | 102112110210001 |
4 | 113120300221 |
5 | 3032140404 |
6 | 335223001 |
7 | 103052563 |
oct | 27306051 |
9 | 12473701 |
10 | 6130729 |
11 | 3508120 |
12 | 2077a61 |
13 | 1368667 |
14 | b58333 |
15 | 8117a4 |
hex | 5d8c29 |
6130729 has 4 divisors (see below), whose sum is σ = 6688080. Its totient is φ = 5573380.
The previous prime is 6130717. The next prime is 6130739. The reversal of 6130729 is 9270316.
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 6130729 - 25 = 6130697 is a prime.
It is an Ulam number.
It is a Duffinian number.
6130729 is a lucky number.
It is a junction number, because it is equal to n+sod(n) for n = 6130697 and 6130706.
It is not an unprimeable number, because it can be changed into a prime (6130739) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 278659 + ... + 278680.
It is an arithmetic number, because the mean of its divisors is an integer number (1672020).
Almost surely, 26130729 is an apocalyptic number.
It is an amenable number.
6130729 is a deficient number, since it is larger than the sum of its proper divisors (557351).
6130729 is a wasteful number, since it uses less digits than its factorization.
6130729 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 557350.
The product of its (nonzero) digits is 2268, while the sum is 28.
The square root of 6130729 is about 2476.0308964147. The cubic root of 6130729 is about 183.0223130646.
It can be divided in two parts, 6130 and 729, that added together give a cube (6859 = 193).
The spelling of 6130729 in words is "six million, one hundred thirty thousand, seven hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •