Base | Representation |
---|---|
bin | 100111110001111011… |
… | …011110010101011101 |
3 | 11002020210011222101202 |
4 | 213301323132111131 |
5 | 1144434140333334 |
6 | 31342232445245 |
7 | 3041324441003 |
oct | 476173362535 |
9 | 132223158352 |
10 | 42713605469 |
11 | 17129797a97 |
12 | 8340849825 |
13 | 4049320982 |
14 | 20d2b42a73 |
15 | 119ed5817e |
hex | 9f1ede55d |
42713605469 has 4 divisors (see below), whose sum is σ = 42716894844. Its totient is φ = 42710316096.
The previous prime is 42713605447. The next prime is 42713605489. The reversal of 42713605469 is 96450631724.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 11457133444 + 31256472025 = 107038^2 + 176795^2 .
It is a cyclic number.
It is not a de Polignac number, because 42713605469 - 212 = 42713601373 is a prime.
It is a super-2 number, since 2×427136054692 (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 (42713605489) 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, 1625132 + ... + 1651205.
It is an arithmetic number, because the mean of its divisors is an integer number (10679223711).
Almost surely, 242713605469 is an apocalyptic number.
It is an amenable number.
42713605469 is a deficient number, since it is larger than the sum of its proper divisors (3289375).
42713605469 is a wasteful number, since it uses less digits than its factorization.
42713605469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3289374.
The product of its (nonzero) digits is 1088640, while the sum is 47.
The spelling of 42713605469 in words is "forty-two billion, seven hundred thirteen million, six hundred five thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •