Base | Representation |
---|---|
bin | 101101101000101000101010… |
… | …010011110010101010000001 |
3 | 222022122011110220002020100100 |
4 | 231220220222103302222001 |
5 | 202301320340040322002 |
6 | 1550510220002113013 |
7 | 60163265252012316 |
oct | 5550505223625201 |
9 | 868564426066310 |
10 | 200704531573377 |
11 | 58a5034a798107 |
12 | 1a615a7164b769 |
13 | 87cb482508790 |
14 | 377c218ad2d0d |
15 | 1830bbadc011c |
hex | b68a2a4f2a81 |
200704531573377 has 48 divisors (see below), whose sum is σ = 330574328098560. Its totient is φ = 116244399545856.
The previous prime is 200704531573349. The next prime is 200704531573499. The reversal of 200704531573377 is 773375135407002.
200704531573377 is a `hidden beast` number, since 2 + 0 + 0 + 7 + 0 + 4 + 5 + 31 + 573 + 37 + 7 = 666.
It is not a de Polignac number, because 200704531573377 - 218 = 200704531311233 is a prime.
It is a super-2 number, since 2×2007045315733772 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (200704531574377) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 481422024 + ... + 481838742.
It is an arithmetic number, because the mean of its divisors is an integer number (6886965168720).
Almost surely, 2200704531573377 is an apocalyptic number.
It is an amenable number.
200704531573377 is a deficient number, since it is larger than the sum of its proper divisors (129869796525183).
200704531573377 is a wasteful number, since it uses less digits than its factorization.
200704531573377 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 658902 (or 658899 counting only the distinct ones).
The product of its (nonzero) digits is 12965400, while the sum is 54.
The spelling of 200704531573377 in words is "two hundred trillion, seven hundred four billion, five hundred thirty-one million, five hundred seventy-three thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.155 sec. • engine limits •