Base | Representation |
---|---|
bin | 1100000000111001111… |
… | …0100110110010101011 |
3 | 201201202110112011112021 |
4 | 3000032132212302223 |
5 | 11340202220200233 |
6 | 234453000525311 |
7 | 20624550252433 |
oct | 3001636466253 |
9 | 651673464467 |
10 | 206401334443 |
11 | 7a597199547 |
12 | 34003480837 |
13 | 166045a5a35 |
14 | 9dc03212c3 |
15 | 5580435e2d |
hex | 300e7a6cab |
206401334443 has 2 divisors, whose sum is σ = 206401334444. Its totient is φ = 206401334442.
The previous prime is 206401334431. The next prime is 206401334471. The reversal of 206401334443 is 344433104602.
206401334443 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-206401334443 is a prime.
It is a super-2 number, since 2×2064013344432 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 206401334399 and 206401334408.
It is not a weakly prime, because it can be changed into another prime (206401334423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 103200667221 + 103200667222.
It is an arithmetic number, because the mean of its divisors is an integer number (103200667222).
Almost surely, 2206401334443 is an apocalyptic number.
206401334443 is a deficient number, since it is larger than the sum of its proper divisors (1).
206401334443 is an equidigital number, since it uses as much as digits as its factorization.
206401334443 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 82944, while the sum is 34.
The spelling of 206401334443 in words is "two hundred six billion, four hundred one million, three hundred thirty-four thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •