Base | Representation |
---|---|
bin | 110100011110101110110100… |
… | …0011101111001110111110110 |
3 | 2020112110111022022121012111120 |
4 | 1220331131220131321313312 |
5 | 441001142332411121340 |
6 | 4313441314423044410 |
7 | 166142661244352142 |
oct | 15075355035716766 |
9 | 2215414268535446 |
10 | 461620542676470 |
11 | 1240a5199a11061 |
12 | 439351a18a0706 |
13 | 16a76826c74b28 |
14 | 81dc7a6a58222 |
15 | 3857c229c94d0 |
hex | 1a3d768779df6 |
461620542676470 has 64 divisors (see below), whose sum is σ = 1108101736594944. Its totient is φ = 123075209953280.
The previous prime is 461620542676441. The next prime is 461620542676471. The reversal of 461620542676470 is 74676245026164.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (461620542676471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3675523375 + ... + 3675648965.
It is an arithmetic number, because the mean of its divisors is an integer number (17314089634296).
Almost surely, 2461620542676470 is an apocalyptic number.
461620542676470 is an abundant number, since it is smaller than the sum of its proper divisors (646481193918474).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
461620542676470 is a wasteful number, since it uses less digits than its factorization.
461620542676470 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148117.
The product of its (nonzero) digits is 81285120, while the sum is 60.
It can be divided in two parts, 4616205 and 42676470, that added together give a triangular number (47292675 = T9725).
The spelling of 461620542676470 in words is "four hundred sixty-one trillion, six hundred twenty billion, five hundred forty-two million, six hundred seventy-six thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •