Base | Representation |
---|---|
bin | 100111101000110001… |
… | …100100010010010101 |
3 | 11001212002011200202212 |
4 | 213220301210102111 |
5 | 1144130330412321 |
6 | 31315104443205 |
7 | 3034451100620 |
oct | 475061442225 |
9 | 131762150685 |
10 | 42560013461 |
11 | 17060022049 |
12 | 82b9319505 |
13 | 4023564b24 |
14 | 20ba5a0db7 |
15 | 119161955b |
hex | 9e8c64495 |
42560013461 has 8 divisors (see below), whose sum is σ = 48752872704. Its totient is φ = 36395368560.
The previous prime is 42560013449. The next prime is 42560013473. The reversal of 42560013461 is 16431006524.
It is an interprime number because it is at equal distance from previous prime (42560013449) and next prime (42560013473).
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-42560013461 is a prime.
It is a super-2 number, since 2×425600134612 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42560013161) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7050350 + ... + 7056383.
It is an arithmetic number, because the mean of its divisors is an integer number (6094109088).
Almost surely, 242560013461 is an apocalyptic number.
It is an amenable number.
42560013461 is a deficient number, since it is larger than the sum of its proper divisors (6192859243).
42560013461 is a wasteful number, since it uses less digits than its factorization.
42560013461 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14107171.
The product of its (nonzero) digits is 17280, while the sum is 32.
Adding to 42560013461 its reverse (16431006524), we get a palindrome (58991019985).
The spelling of 42560013461 in words is "forty-two billion, five hundred sixty million, thirteen thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •