Base | Representation |
---|---|
bin | 1110001001000111100… |
… | …10011011010110110101 |
3 | 1201110021102021100201000 |
4 | 13010203302123112311 |
5 | 30430142010220021 |
6 | 1011122311153513 |
7 | 50051561344122 |
oct | 7044362332665 |
9 | 1643242240630 |
10 | 485931726261 |
11 | 17809a878193 |
12 | 7a215675899 |
13 | 36a91656047 |
14 | 1973aa57749 |
15 | c990a15b26 |
hex | 7123c9b5b5 |
485931726261 has 32 divisors (see below), whose sum is σ = 733719306240. Its totient is φ = 317739240000.
The previous prime is 485931726233. The next prime is 485931726277. The reversal of 485931726261 is 162627139584.
It is a happy number.
485931726261 is a `hidden beast` number, since 4 + 8 + 5 + 9 + 3 + 1 + 7 + 2 + 626 + 1 = 666.
It is not a de Polignac number, because 485931726261 - 229 = 485394855349 is a prime.
It is a super-2 number, since 2×4859317262612 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 485931726198 and 485931726207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (485931726061) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4498636 + ... + 4605386.
It is an arithmetic number, because the mean of its divisors is an integer number (22928728320).
Almost surely, 2485931726261 is an apocalyptic number.
It is an amenable number.
485931726261 is a deficient number, since it is larger than the sum of its proper divisors (247787579979).
485931726261 is a wasteful number, since it uses less digits than its factorization.
485931726261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109994 (or 109988 counting only the distinct ones).
The product of its digits is 4354560, while the sum is 54.
The spelling of 485931726261 in words is "four hundred eighty-five billion, nine hundred thirty-one million, seven hundred twenty-six thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •