Base | Representation |
---|---|
bin | 1000110101110100… |
… | …01111110100011101 |
3 | 110020210021100012111 |
4 | 10122322033310131 |
5 | 34210042202221 |
6 | 2102552434021 |
7 | 225423052222 |
oct | 43272176435 |
9 | 13223240174 |
10 | 4746444061 |
11 | 2016275747 |
12 | b056a8911 |
13 | 5a84727a8 |
14 | 33053b949 |
15 | 1cba6dbe1 |
hex | 11ae8fd1d |
4746444061 has 4 divisors (see below), whose sum is σ = 4795376572. Its totient is φ = 4697511552.
The previous prime is 4746443993. The next prime is 4746444067. The reversal of 4746444061 is 1604446474.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3786063961 + 960380100 = 61531^2 + 30990^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4746444061 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 (4746444067) 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, 24466110 + ... + 24466303.
It is an arithmetic number, because the mean of its divisors is an integer number (1198844143).
Almost surely, 24746444061 is an apocalyptic number.
It is an amenable number.
4746444061 is a deficient number, since it is larger than the sum of its proper divisors (48932511).
4746444061 is an equidigital number, since it uses as much as digits as its factorization.
4746444061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48932510.
The product of its (nonzero) digits is 258048, while the sum is 40.
The square root of 4746444061 is about 68894.4414376080. The cubic root of 4746444061 is about 1680.5681257171.
The spelling of 4746444061 in words is "four billion, seven hundred forty-six million, four hundred forty-four thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •