Base | Representation |
---|---|
bin | 11011011111101… |
… | …111110000000001 |
3 | 1012011000211002001 |
4 | 123133233300001 |
5 | 1421043310011 |
6 | 113435224001 |
7 | 14301021010 |
oct | 3337576001 |
9 | 1164024061 |
10 | 461306881 |
11 | 217439762 |
12 | 10a5a8001 |
13 | 74758369 |
14 | 453a2a77 |
15 | 2a7737c1 |
hex | 1b7efc01 |
461306881 has 8 divisors (see below), whose sum is σ = 539468864. Its totient is φ = 386210160.
The previous prime is 461306873. The next prime is 461306887. The reversal of 461306881 is 188603164.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 461306881 - 23 = 461306873 is a prime.
It is a super-2 number, since 2×4613068812 = 425608076915896322, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 461306881.
It is not an unprimeable number, because it can be changed into a prime (461306887) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 765990 + ... + 766591.
It is an arithmetic number, because the mean of its divisors is an integer number (67433608).
Almost surely, 2461306881 is an apocalyptic number.
It is an amenable number.
461306881 is a deficient number, since it is larger than the sum of its proper divisors (78161983).
461306881 is a wasteful number, since it uses less digits than its factorization.
461306881 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1532631.
The product of its (nonzero) digits is 27648, while the sum is 37.
The square root of 461306881 is about 21478.0558012125. The cubic root of 461306881 is about 772.6746146820.
The spelling of 461306881 in words is "four hundred sixty-one million, three hundred six thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •