Base | Representation |
---|---|
bin | 100001111010011101100… |
… | …1011100011110001111101 |
3 | 121111120221100210000112101 |
4 | 1003310323023203301331 |
5 | 1102331243243331140 |
6 | 13525125420305101 |
7 | 660514504501255 |
oct | 103647313436175 |
9 | 17446840700471 |
10 | 4661032402045 |
11 | 1537807307158 |
12 | 63340a3a2191 |
13 | 27a6c20566b6 |
14 | 12184921a965 |
15 | 8139e00c99a |
hex | 43d3b2e3c7d |
4661032402045 has 4 divisors (see below), whose sum is σ = 5593238882460. Its totient is φ = 3728825921632.
The previous prime is 4661032402027. The next prime is 4661032402049. The reversal of 4661032402045 is 5402042301664.
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 2664997480324 + 1996034921721 = 1632482^2 + 1412811^2 .
It is a cyclic number.
It is not a de Polignac number, because 4661032402045 - 219 = 4661031877757 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4661032401995 and 4661032402013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4661032402049) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 466103240200 + ... + 466103240209.
It is an arithmetic number, because the mean of its divisors is an integer number (1398309720615).
Almost surely, 24661032402045 is an apocalyptic number.
It is an amenable number.
4661032402045 is a deficient number, since it is larger than the sum of its proper divisors (932206480415).
4661032402045 is an equidigital number, since it uses as much as digits as its factorization.
4661032402045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 932206480414.
The product of its (nonzero) digits is 138240, while the sum is 37.
The spelling of 4661032402045 in words is "four trillion, six hundred sixty-one billion, thirty-two million, four hundred two thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •