Base | Representation |
---|---|
bin | 1101011011101110011… |
… | …00011111110100000101 |
3 | 1122010100222221200020222 |
4 | 12231313030133310011 |
5 | 30030234140443123 |
6 | 552012135434125 |
7 | 45226630010633 |
oct | 6556714376405 |
9 | 1563328850228 |
10 | 461561265413 |
11 | 168824335256 |
12 | 75553b25945 |
13 | 346a968b701 |
14 | 184a8146353 |
15 | c0162486c8 |
hex | 6b7731fd05 |
461561265413 has 8 divisors (see below), whose sum is σ = 471085025688. Its totient is φ = 452067692544.
The previous prime is 461561265397. The next prime is 461561265427. The reversal of 461561265413 is 314562165164.
It can be written as a sum of positive squares in 4 ways, for example, as 224336744164 + 237224521249 = 473642^2 + 487057^2 .
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 461561265413 - 24 = 461561265397 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 (461561265313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7515956 + ... + 7577117.
It is an arithmetic number, because the mean of its divisors is an integer number (58885628211).
Almost surely, 2461561265413 is an apocalyptic number.
It is an amenable number.
461561265413 is a deficient number, since it is larger than the sum of its proper divisors (9523760275).
461561265413 is a wasteful number, since it uses less digits than its factorization.
461561265413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15093703.
The product of its digits is 518400, while the sum is 44.
The spelling of 461561265413 in words is "four hundred sixty-one billion, five hundred sixty-one million, two hundred sixty-five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •