Base | Representation |
---|---|
bin | 10011011000110110110110… |
… | …01110001010110010100101 |
3 | 12120221220201220222202200102 |
4 | 21230123123032022302211 |
5 | 21042020022431221423 |
6 | 230402253343153445 |
7 | 11660213004361421 |
oct | 1154333316126245 |
9 | 176856656882612 |
10 | 42635523304613 |
11 | 12648695443a38 |
12 | 49470725a5885 |
13 | 1aa36882346b5 |
14 | a757db019b81 |
15 | 4de0ab515c28 |
hex | 26c6db38aca5 |
42635523304613 has 4 divisors (see below), whose sum is σ = 42635536390080. Its totient is φ = 42635510219148.
The previous prime is 42635523304603. The next prime is 42635523304691. The reversal of 42635523304613 is 31640332553624.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 42635523304613 - 24 = 42635523304597 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42635523304603) 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, 2649578 + ... + 9606836.
It is an arithmetic number, because the mean of its divisors is an integer number (10658884097520).
Almost surely, 242635523304613 is an apocalyptic number.
It is an amenable number.
42635523304613 is a deficient number, since it is larger than the sum of its proper divisors (13085467).
42635523304613 is an equidigital number, since it uses as much as digits as its factorization.
42635523304613 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13085466.
The product of its (nonzero) digits is 4665600, while the sum is 47.
The spelling of 42635523304613 in words is "forty-two trillion, six hundred thirty-five billion, five hundred twenty-three million, three hundred four thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •