Base | Representation |
---|---|
bin | 1111011001011010… |
… | …1000111101001001 |
3 | 101200001012202120000 |
4 | 3312112220331021 |
5 | 31431040130212 |
6 | 1522043153213 |
7 | 204265011600 |
oct | 36626507511 |
9 | 11601182500 |
10 | 4133130057 |
11 | 1831053871 |
12 | 974215809 |
13 | 50b394ab4 |
14 | 2b2ccaa37 |
15 | 192cc11dc |
hex | f65a8f49 |
4133130057 has 60 divisors (see below), whose sum is σ = 7203364740. Its totient is φ = 2354837184.
The previous prime is 4133130011. The next prime is 4133130073. The reversal of 4133130057 is 7500313314.
It can be written as a sum of positive squares in 2 ways, for example, as 414081801 + 3719048256 = 20349^2 + 60984^2 .
It is not a de Polignac number, because 4133130057 - 28 = 4133129801 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 4133130057.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4133130077) by changing a digit.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 1542603 + ... + 1545279.
It is an arithmetic number, because the mean of its divisors is an integer number (120056079).
Almost surely, 24133130057 is an apocalyptic number.
It is an amenable number.
4133130057 is a deficient number, since it is larger than the sum of its proper divisors (3070234683).
4133130057 is a wasteful number, since it uses less digits than its factorization.
4133130057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3092 (or 3076 counting only the distinct ones).
The product of its (nonzero) digits is 3780, while the sum is 27.
The square root of 4133130057 is about 64289.4241458111. The cubic root of 4133130057 is about 1604.8201073600.
The spelling of 4133130057 in words is "four billion, one hundred thirty-three million, one hundred thirty thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •