Base | Representation |
---|---|
bin | 1010100011111011… |
… | …01110111110111101 |
3 | 112122011022011211200 |
4 | 11101331232332331 |
5 | 43103021330041 |
6 | 2334350010113 |
7 | 260340045300 |
oct | 52175567675 |
9 | 15564264750 |
10 | 5670105021 |
11 | 244a698909 |
12 | 1122aa6939 |
13 | 6c4931a39 |
14 | 3bb096b37 |
15 | 232bc11b6 |
hex | 151f6efbd |
5670105021 has 18 divisors (see below), whose sum is σ = 9527320062. Its totient is φ = 3240059760.
The previous prime is 5670105019. The next prime is 5670105031. The reversal of 5670105021 is 1205010765.
It can be written as a sum of positive squares in only one way, i.e., 3879545796 + 1790559225 = 62286^2 + 42315^2 .
It is not a de Polignac number, because 5670105021 - 21 = 5670105019 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5670105031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 6428250 + ... + 6429131.
It is an arithmetic number, because the mean of its divisors is an integer number (529295559).
Almost surely, 25670105021 is an apocalyptic number.
It is an amenable number.
5670105021 is a deficient number, since it is larger than the sum of its proper divisors (3857215041).
5670105021 is a wasteful number, since it uses less digits than its factorization.
5670105021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12857401 (or 12857391 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 27.
The square root of 5670105021 is about 75300.0997409698. The cubic root of 5670105021 is about 1783.1875952253.
Adding to 5670105021 its reverse (1205010765), we get a palindrome (6875115786).
The spelling of 5670105021 in words is "five billion, six hundred seventy million, one hundred five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •