Base | Representation |
---|---|
bin | 1101011001110100110… |
… | …01110010101100001111 |
3 | 1122000201220210010012122 |
4 | 12230322121302230033 |
5 | 30021142040343211 |
6 | 551323023123155 |
7 | 45162433542464 |
oct | 6547231625417 |
9 | 1560656703178 |
10 | 460541340431 |
11 | 168350642547 |
12 | 7530a4434bb |
13 | 345762962c3 |
14 | 1840c8cd66b |
15 | bea692d6db |
hex | 6b3a672b0f |
460541340431 has 4 divisors (see below), whose sum is σ = 460544045664. Its totient is φ = 460538635200.
The previous prime is 460541340419. The next prime is 460541340437. The reversal of 460541340431 is 134043145064.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-460541340431 is a prime.
It is a super-2 number, since 2×4605413404312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 460541340391 and 460541340400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (460541340437) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1078775 + ... + 1443896.
It is an arithmetic number, because the mean of its divisors is an integer number (115136011416).
Almost surely, 2460541340431 is an apocalyptic number.
460541340431 is a deficient number, since it is larger than the sum of its proper divisors (2705233).
460541340431 is a wasteful number, since it uses less digits than its factorization.
460541340431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2705232.
The product of its (nonzero) digits is 69120, while the sum is 35.
Adding to 460541340431 its reverse (134043145064), we get a palindrome (594584485495).
The spelling of 460541340431 in words is "four hundred sixty billion, five hundred forty-one million, three hundred forty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •