Base | Representation |
---|---|
bin | 110100011111010101101101… |
… | …1001101111110100110101101 |
3 | 2020112202110220122020200212221 |
4 | 1220332223123031332212231 |
5 | 441004024414444310023 |
6 | 4313543531143555341 |
7 | 166152006215165602 |
oct | 15076533315764655 |
9 | 2215673818220787 |
10 | 461704072260013 |
11 | 124127663210530 |
12 | 4394941375bb51 |
13 | 16a816794037cb |
14 | 820284c4926a9 |
15 | 3859eb0c9a85d |
hex | 1a3eadb37e9ad |
461704072260013 has 8 divisors (see below), whose sum is σ = 519924820375296. Its totient is φ = 406191265917600.
The previous prime is 461704072260001. The next prime is 461704072260061. The reversal of 461704072260013 is 310062270407164.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-461704072260013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (461704072260073) 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 7 ways as a sum of consecutive naturals, for example, 676985442856 + ... + 676985443537.
It is an arithmetic number, because the mean of its divisors is an integer number (64990602546912).
Almost surely, 2461704072260013 is an apocalyptic number.
It is an amenable number.
461704072260013 is a deficient number, since it is larger than the sum of its proper divisors (58220748115283).
461704072260013 is a wasteful number, since it uses less digits than its factorization.
461704072260013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1353970886435.
The product of its (nonzero) digits is 338688, while the sum is 43.
The spelling of 461704072260013 in words is "four hundred sixty-one trillion, seven hundred four billion, seventy-two million, two hundred sixty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •