Base | Representation |
---|---|
bin | 1111000100011010… |
… | …1110011010111101 |
3 | 101102220111221200202 |
4 | 3301012232122331 |
5 | 31241014301221 |
6 | 1505215533245 |
7 | 202145355002 |
oct | 36106563275 |
9 | 11386457622 |
10 | 4045072061 |
11 | 1796379568 |
12 | 94a82a225 |
13 | 4c6072a84 |
14 | 2a53278a9 |
15 | 18a1c9d0b |
hex | f11ae6bd |
4045072061 has 4 divisors (see below), whose sum is σ = 4131137472. Its totient is φ = 3959006652.
The previous prime is 4045072043. The next prime is 4045072063. The reversal of 4045072061 is 1602705404.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4045072061 - 218 = 4044809917 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 (4045072063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43032635 + ... + 43032728.
It is an arithmetic number, because the mean of its divisors is an integer number (1032784368).
Almost surely, 24045072061 is an apocalyptic number.
It is an amenable number.
4045072061 is a deficient number, since it is larger than the sum of its proper divisors (86065411).
4045072061 is an equidigital number, since it uses as much as digits as its factorization.
4045072061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86065410.
The product of its (nonzero) digits is 6720, while the sum is 29.
The square root of 4045072061 is about 63600.8809766028. The cubic root of 4045072061 is about 1593.3410831551.
Adding to 4045072061 its reverse (1602705404), we get a palindrome (5647777465).
The spelling of 4045072061 in words is "four billion, forty-five million, seventy-two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •