Base | Representation |
---|---|
bin | 1111000110000111… |
… | …0001001000100101 |
3 | 101110101212002222022 |
4 | 3301201301020211 |
5 | 31244323123221 |
6 | 1510031512525 |
7 | 202262541434 |
oct | 36141611045 |
9 | 11411762868 |
10 | 4052161061 |
11 | 179a380643 |
12 | 951088745 |
13 | 4c7685650 |
14 | 2a625111b |
15 | 18ab2a4ab |
hex | f1871225 |
4052161061 has 8 divisors (see below), whose sum is σ = 4425329664. Its totient is φ = 3687773040.
The previous prime is 4052161049. The next prime is 4052161081. The reversal of 4052161061 is 1601612504.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4052161061 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 4052161061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4052161031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2194181 + ... + 2196026.
It is an arithmetic number, because the mean of its divisors is an integer number (553166208).
Almost surely, 24052161061 is an apocalyptic number.
It is an amenable number.
4052161061 is a deficient number, since it is larger than the sum of its proper divisors (373168603).
4052161061 is a wasteful number, since it uses less digits than its factorization.
4052161061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4390291.
The product of its (nonzero) digits is 1440, while the sum is 26.
The square root of 4052161061 is about 63656.5869411799. The cubic root of 4052161061 is about 1594.2713181751.
Adding to 4052161061 its reverse (1601612504), we get a palindrome (5653773565).
The spelling of 4052161061 in words is "four billion, fifty-two million, one hundred sixty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •