Base | Representation |
---|---|
bin | 101111000101000011100010… |
… | …010101001011101111000100 |
3 | 1000011010022122102022112121101 |
4 | 233011003202111023233010 |
5 | 204114344312114000401 |
6 | 2012212004240225444 |
7 | 61420162211054164 |
oct | 5705034225135704 |
9 | 1004108572275541 |
10 | 207055580609476 |
11 | 5aa79862365195 |
12 | 1b28091300b284 |
13 | 8b6c3468827c1 |
14 | 391b7877c85a4 |
15 | 18e0ece027101 |
hex | bc50e254bbc4 |
207055580609476 has 45 divisors (see below), whose sum is σ = 370338084197389. Its totient is φ = 101293961423072.
The previous prime is 207055580609407. The next prime is 207055580609477. The reversal of 207055580609476 is 674906085550702.
The square root of 207055580609476 is 14389426.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 177429592872900 + 29625987736576 = 13320270^2 + 5442976^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (207055580609477) 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 14 ways as a sum of consecutive naturals, for example, 63572482440 + ... + 63572485696.
Almost surely, 2207055580609476 is an apocalyptic number.
207055580609476 is the 14389426-th square number.
It is an amenable number.
207055580609476 is a deficient number, since it is larger than the sum of its proper divisors (163282503587913).
207055580609476 is an frugal number, since it uses more digits than its factorization.
207055580609476 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6706 (or 3306 counting only the distinct ones).
The product of its (nonzero) digits is 127008000, while the sum is 64.
The spelling of 207055580609476 in words is "two hundred seven trillion, fifty-five billion, five hundred eighty million, six hundred nine thousand, four hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •