Base | Representation |
---|---|
bin | 1100000000000100000… |
… | …0000011110101101101 |
3 | 201201011201001112010220 |
4 | 3000001000003311231 |
5 | 11334221324120044 |
6 | 234414322321553 |
7 | 20616133324020 |
oct | 3000100036555 |
9 | 651151045126 |
10 | 206175223149 |
11 | 7a4905a1805 |
12 | 33b5b7b92b9 |
13 | 165997a877c |
14 | 9d9c2a31b7 |
15 | 556a670019 |
hex | 3001003d6d |
206175223149 has 32 divisors (see below), whose sum is σ = 319208094720. Its totient is φ = 115938345600.
The previous prime is 206175223141. The next prime is 206175223157. The reversal of 206175223149 is 941322571602.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (206175223141) and next prime (206175223157).
It is not a de Polignac number, because 206175223149 - 23 = 206175223141 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 206175223149.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206175223141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 132954 + ... + 655764.
It is an arithmetic number, because the mean of its divisors is an integer number (9975252960).
Almost surely, 2206175223149 is an apocalyptic number.
It is an amenable number.
206175223149 is a deficient number, since it is larger than the sum of its proper divisors (113032871571).
206175223149 is a wasteful number, since it uses less digits than its factorization.
206175223149 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 523121.
The product of its (nonzero) digits is 181440, while the sum is 42.
The spelling of 206175223149 in words is "two hundred six billion, one hundred seventy-five million, two hundred twenty-three thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •