Base | Representation |
---|---|
bin | 1101011100010010001… |
… | …01101101001000111001 |
3 | 1122011010220211220012212 |
4 | 12232021011231020321 |
5 | 30031343014143443 |
6 | 552102022144505 |
7 | 45240233522111 |
oct | 6561105551071 |
9 | 1564126756185 |
10 | 461861474873 |
11 | 168968842047 |
12 | 75618582135 |
13 | 34726930946 |
14 | 184d5d72041 |
15 | c032799618 |
hex | 6b8916d239 |
461861474873 has 4 divisors (see below), whose sum is σ = 462089331600. Its totient is φ = 461633618148.
The previous prime is 461861474839. The next prime is 461861474917. The reversal of 461861474873 is 378474168164.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 461861474873 - 220 = 461860426297 is a prime.
It is a super-2 number, since 2×4618614748732 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (461861479873) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 113925323 + ... + 113929376.
It is an arithmetic number, because the mean of its divisors is an integer number (115522332900).
Almost surely, 2461861474873 is an apocalyptic number.
It is an amenable number.
461861474873 is a deficient number, since it is larger than the sum of its proper divisors (227856727).
461861474873 is a wasteful number, since it uses less digits than its factorization.
461861474873 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227856726.
The product of its digits is 21676032, while the sum is 59.
The spelling of 461861474873 in words is "four hundred sixty-one billion, eight hundred sixty-one million, four hundred seventy-four thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •