Base | Representation |
---|---|
bin | 10011011111000111110101… |
… | …10011011001100110101001 |
3 | 12121201111102000221100220021 |
4 | 21233203322303121212221 |
5 | 21104031420142214423 |
6 | 231045215250400441 |
7 | 12011603544135463 |
oct | 1157437263314651 |
9 | 177644360840807 |
10 | 42850801523113 |
11 | 12720a173838a1 |
12 | 4980932890121 |
13 | 1abaa7591243c |
14 | a81dc0265133 |
15 | 4e49aae0995d |
hex | 26f8facd99a9 |
42850801523113 has 4 divisors (see below), whose sum is σ = 42962683511808. Its totient is φ = 42738919534420.
The previous prime is 42850801523021. The next prime is 42850801523119. The reversal of 42850801523113 is 31132510805824.
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.
It is a cyclic number.
It is not a de Polignac number, because 42850801523113 - 29 = 42850801522601 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 42850801523113.
It is not an unprimeable number, because it can be changed into a prime (42850801523119) 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, 55940993773 + ... + 55940994538.
It is an arithmetic number, because the mean of its divisors is an integer number (10740670877952).
Almost surely, 242850801523113 is an apocalyptic number.
It is an amenable number.
42850801523113 is a deficient number, since it is larger than the sum of its proper divisors (111881988695).
42850801523113 is a wasteful number, since it uses less digits than its factorization.
42850801523113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111881988694.
The product of its (nonzero) digits is 230400, while the sum is 43.
The spelling of 42850801523113 in words is "forty-two trillion, eight hundred fifty billion, eight hundred one million, five hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •