Base | Representation |
---|---|
bin | 1101011010110000011… |
… | …01111001101001110111 |
3 | 1122002000202222212121121 |
4 | 12231120031321221313 |
5 | 30023203113232303 |
6 | 551444412124411 |
7 | 45211016266423 |
oct | 6553015715167 |
9 | 1562022885547 |
10 | 461041539703 |
11 | 168587a25678 |
12 | 75429a66707 |
13 | 34625abacc4 |
14 | 184590d7b83 |
15 | bed57d59bd |
hex | 6b58379a77 |
461041539703 has 4 divisors (see below), whose sum is σ = 466877508640. Its totient is φ = 455205570768.
The previous prime is 461041539701. The next prime is 461041539713. The reversal of 461041539703 is 307935140164.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 461041539703 - 21 = 461041539701 is a prime.
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 461041539703.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (461041539701) 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 3 ways as a sum of consecutive naturals, for example, 2917984350 + ... + 2917984507.
It is an arithmetic number, because the mean of its divisors is an integer number (116719377160).
Almost surely, 2461041539703 is an apocalyptic number.
461041539703 is a deficient number, since it is larger than the sum of its proper divisors (5835968937).
461041539703 is an equidigital number, since it uses as much as digits as its factorization.
461041539703 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5835968936.
The product of its (nonzero) digits is 272160, while the sum is 43.
Adding to 461041539703 its reverse (307935140164), we get a palindrome (768976679867).
The spelling of 461041539703 in words is "four hundred sixty-one billion, forty-one million, five hundred thirty-nine thousand, seven hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •