Base | Representation |
---|---|
bin | 100111001111001010… |
… | …110001000000001111 |
3 | 11000202010210122201102 |
4 | 213033022301000033 |
5 | 1142240341132120 |
6 | 31204320533315 |
7 | 3021013406102 |
oct | 471712610017 |
9 | 130663718642 |
10 | 42130411535 |
11 | 1695a578833 |
12 | 81b948123b |
13 | 3c8555a7c4 |
14 | 20794d2739 |
15 | 1168a59d75 |
hex | 9cf2b100f |
42130411535 has 4 divisors (see below), whose sum is σ = 50556493848. Its totient is φ = 33704329224.
The previous prime is 42130411513. The next prime is 42130411553. The reversal of 42130411535 is 53511403124.
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-42130411535 is a prime.
It is a super-2 number, since 2×421304115352 (a number of 22 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 = 42130411498 and 42130411507.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4213041149 + ... + 4213041158.
It is an arithmetic number, because the mean of its divisors is an integer number (12639123462).
Almost surely, 242130411535 is an apocalyptic number.
42130411535 is a deficient number, since it is larger than the sum of its proper divisors (8426082313).
42130411535 is an equidigital number, since it uses as much as digits as its factorization.
42130411535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8426082312.
The product of its (nonzero) digits is 7200, while the sum is 29.
Adding to 42130411535 its reverse (53511403124), we get a palindrome (95641814659).
The spelling of 42130411535 in words is "forty-two billion, one hundred thirty million, four hundred eleven thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •