Base | Representation |
---|---|
bin | 110100011110101010000001… |
… | …1100111000110110001111111 |
3 | 2020112102111202202011101222010 |
4 | 1220331110003213012301333 |
5 | 441001010303211431411 |
6 | 4313432454243422303 |
7 | 166142145403540632 |
oct | 15075240347066177 |
9 | 2215374682141863 |
10 | 461610260655231 |
11 | 1240a08a2a92346 |
12 | 439331b2384993 |
13 | 16a75878a12cac |
14 | 81dc0ad281c19 |
15 | 385781eeae7a6 |
hex | 1a3d5039c6c7f |
461610260655231 has 8 divisors (see below), whose sum is σ = 615481188292224. Its totient is φ = 307739753394200.
The previous prime is 461610260655221. The next prime is 461610260655301. The reversal of 461610260655231 is 132556062016164.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 461610260655231 - 25 = 461610260655199 is a prime.
It is a super-2 number, since 2×4616102606552312 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (461610260655221) 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, 102522795 + ... + 106930556.
It is an arithmetic number, because the mean of its divisors is an integer number (76935148536528).
Almost surely, 2461610260655231 is an apocalyptic number.
461610260655231 is a deficient number, since it is larger than the sum of its proper divisors (153870927636993).
461610260655231 is a wasteful number, since it uses less digits than its factorization.
461610260655231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210187981.
The product of its (nonzero) digits is 1555200, while the sum is 48.
The spelling of 461610260655231 in words is "four hundred sixty-one trillion, six hundred ten billion, two hundred sixty million, six hundred fifty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •