Base | Representation |
---|---|
bin | 1100000000101110001… |
… | …1101001111011000101 |
3 | 201201122001022022001101 |
4 | 3000023203221323011 |
5 | 11340102143420331 |
6 | 234444050300101 |
7 | 20623413555610 |
oct | 3001343517305 |
9 | 651561268041 |
10 | 206352326341 |
11 | 7a571565a87 |
12 | 33baab87631 |
13 | 165c73a6c65 |
14 | 9db7a05177 |
15 | 557aea5061 |
hex | 300b8e9ec5 |
206352326341 has 4 divisors (see below), whose sum is σ = 235831230112. Its totient is φ = 176873422572.
The previous prime is 206352326333. The next prime is 206352326347. The reversal of 206352326341 is 143623253602.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 206352326341 - 23 = 206352326333 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 206352326341.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206352326347) 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, 14739451875 + ... + 14739451888.
It is an arithmetic number, because the mean of its divisors is an integer number (58957807528).
Almost surely, 2206352326341 is an apocalyptic number.
It is an amenable number.
206352326341 is a deficient number, since it is larger than the sum of its proper divisors (29478903771).
206352326341 is an equidigital number, since it uses as much as digits as its factorization.
206352326341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29478903770.
The product of its (nonzero) digits is 155520, while the sum is 37.
Adding to 206352326341 its reverse (143623253602), we get a palindrome (349975579943).
The spelling of 206352326341 in words is "two hundred six billion, three hundred fifty-two million, three hundred twenty-six thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •