Base | Representation |
---|---|
bin | 1010100101001100… |
… | …11011010101001101 |
3 | 112122220101010202212 |
4 | 11102212123111031 |
5 | 43113234204204 |
6 | 2335410400205 |
7 | 260526524513 |
oct | 52246332515 |
9 | 15586333685 |
10 | 5680772429 |
11 | 2455714452 |
12 | 1126590065 |
13 | 6c6bc8307 |
14 | 3bc6724b3 |
15 | 233acbc6e |
hex | 15299b54d |
5680772429 has 4 divisors (see below), whose sum is σ = 5680933020. Its totient is φ = 5680611840.
The previous prime is 5680772401. The next prime is 5680772477. The reversal of 5680772429 is 9242770865.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4617882025 + 1062890404 = 67955^2 + 32602^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5680772429 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5680772129) 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, 1382 + ... + 106599.
It is an arithmetic number, because the mean of its divisors is an integer number (1420233255).
Almost surely, 25680772429 is an apocalyptic number.
It is an amenable number.
5680772429 is a deficient number, since it is larger than the sum of its proper divisors (160591).
5680772429 is a wasteful number, since it uses less digits than its factorization.
5680772429 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160590.
The product of its (nonzero) digits is 1693440, while the sum is 50.
The square root of 5680772429 is about 75370.8990857877. The cubic root of 5680772429 is about 1784.3051567192.
The spelling of 5680772429 in words is "five billion, six hundred eighty million, seven hundred seventy-two thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.161 sec. • engine limits •