Base | Representation |
---|---|
bin | 101110111000000111100100… |
… | …101010100000110110100000 |
3 | 1000000222022221011001202211122 |
4 | 232320013210222200312200 |
5 | 204010313104222301102 |
6 | 2010251335540031412 |
7 | 61266020405403104 |
oct | 5670074452406640 |
9 | 1000868834052748 |
10 | 206166561525152 |
11 | 5a766825258918 |
12 | 1b158564392568 |
13 | 8b0656709b647 |
14 | 38ca72c945904 |
15 | 18c7ceaa6a0a2 |
hex | bb81e4aa0da0 |
206166561525152 has 24 divisors (see below), whose sum is σ = 407187192520836. Its totient is φ = 102753941202432.
The previous prime is 206166561525151. The next prime is 206166561525167. The reversal of 206166561525152 is 251525165661602.
It can be written as a sum of positive squares in 2 ways, for example, as 113606691918736 + 92559869606416 = 10658644^2 + 9620804^2 .
It is a super-3 number, since 3×2061665615251523 (a number of 44 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 206166561525094 and 206166561525103.
It is not an unprimeable number, because it can be changed into a prime (206166561525151) 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, 10291851083 + ... + 10291871114.
Almost surely, 2206166561525152 is an apocalyptic number.
It is an amenable number.
206166561525152 is a deficient number, since it is larger than the sum of its proper divisors (201020630995684).
206166561525152 is a wasteful number, since it uses less digits than its factorization.
206166561525152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20583722520 (or 20583722512 counting only the distinct ones).
The product of its (nonzero) digits is 6480000, while the sum is 53.
The spelling of 206166561525152 in words is "two hundred six trillion, one hundred sixty-six billion, five hundred sixty-one million, five hundred twenty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •