Base | Representation |
---|---|
bin | 10011011111000111001011… |
… | …10111110011011100101101 |
3 | 12121201110111120011020012101 |
4 | 21233203211313303130231 |
5 | 21104030210242343023 |
6 | 231045120343535101 |
7 | 12011562051230626 |
oct | 1157434567633455 |
9 | 177643446136171 |
10 | 42850450356013 |
11 | 12720857131853 |
12 | 498085515a491 |
13 | 1abaa1ac3ac61 |
14 | a81d89772a4d |
15 | 4e498a1901ad |
hex | 26f8e5df372d |
42850450356013 has 16 divisors (see below), whose sum is σ = 44712219687552. Its totient is φ = 41039416600000.
The previous prime is 42850450356001. The next prime is 42850450356121. The reversal of 42850450356013 is 31065305405824.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-42850450356013 is a prime.
It is a super-2 number, since 2×428504503560132 (a number of 28 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 (42850450356613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 55992763 + ... + 56752888.
It is an arithmetic number, because the mean of its divisors is an integer number (2794513730472).
Almost surely, 242850450356013 is an apocalyptic number.
It is an amenable number.
42850450356013 is a deficient number, since it is larger than the sum of its proper divisors (1861769331539).
42850450356013 is a wasteful number, since it uses less digits than its factorization.
42850450356013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112745876.
The product of its (nonzero) digits is 1728000, while the sum is 46.
The spelling of 42850450356013 in words is "forty-two trillion, eight hundred fifty billion, four hundred fifty million, three hundred fifty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •