Base | Representation |
---|---|
bin | 101101011111001111101101… |
… | …111101101011001100011001 |
3 | 222020100110221210012200202221 |
4 | 231133033231331223030121 |
5 | 202210232343124021111 |
6 | 1545253543422024041 |
7 | 60065543211363064 |
oct | 5537175575531431 |
9 | 866313853180687 |
10 | 200059274048281 |
11 | 5882173073610a |
12 | 1a5309b2118021 |
13 | 878267c4c152b |
14 | 3758cc5d058db |
15 | 181e002be5371 |
hex | b5f3edf6b319 |
200059274048281 has 12 divisors (see below), whose sum is σ = 209136536074368. Its totient is φ = 191360268049544.
The previous prime is 200059274048219. The next prime is 200059274048297. The reversal of 200059274048281 is 182840472950002.
It is not a de Polignac number, because 200059274048281 - 213 = 200059274040089 is a prime.
It is a super-2 number, since 2×2000592740482812 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200059274048681) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 162478956 + ... + 163705618.
It is an arithmetic number, because the mean of its divisors is an integer number (17428044672864).
Almost surely, 2200059274048281 is an apocalyptic number.
It is an amenable number.
200059274048281 is a deficient number, since it is larger than the sum of its proper divisors (9077262026087).
200059274048281 is a wasteful number, since it uses less digits than its factorization.
200059274048281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1535012 (or 1534989 counting only the distinct ones).
The product of its (nonzero) digits is 2580480, while the sum is 52.
The spelling of 200059274048281 in words is "two hundred trillion, fifty-nine billion, two hundred seventy-four million, forty-eight thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •