Base | Representation |
---|---|
bin | 1010101000000010… |
… | …00010001001110111 |
3 | 112201120001212100202 |
4 | 11110001002021313 |
5 | 43140324240112 |
6 | 2342015431115 |
7 | 261235441331 |
oct | 52401021167 |
9 | 15646055322 |
10 | 5704524407 |
11 | 246806768a |
12 | 113252549b |
13 | 6cbac343a |
14 | 3c1896451 |
15 | 235c1e6c2 |
hex | 154042277 |
5704524407 has 4 divisors (see below), whose sum is σ = 5707259856. Its totient is φ = 5701788960.
The previous prime is 5704524389. The next prime is 5704524487. The reversal of 5704524407 is 7044254075.
5704524407 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5704524407 - 214 = 5704508023 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 (5704524487) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1364594 + ... + 1368767.
It is an arithmetic number, because the mean of its divisors is an integer number (1426814964).
Almost surely, 25704524407 is an apocalyptic number.
5704524407 is a deficient number, since it is larger than the sum of its proper divisors (2735449).
5704524407 is a wasteful number, since it uses less digits than its factorization.
5704524407 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2735448.
The product of its (nonzero) digits is 156800, while the sum is 38.
The square root of 5704524407 is about 75528.3020264589. The cubic root of 5704524407 is about 1786.7884954928.
The spelling of 5704524407 in words is "five billion, seven hundred four million, five hundred twenty-four thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •